On the Computation of 3D Visibility Skeletons

DOI10.1007/978-3-642-14031-0_50MaRDI QIDQ3578347zbMATH OpenOpenAlexFDO

Authors Sylvain Lazard, Christophe Weibel, Linqiao Zhang, Sue Whitesides

Publication date 20 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14031-0_50

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A succinct 3D visibility skeleton
• scientific article; zbMATH DE number 3958767
• A framework for n-dimensional visibility computations
• 3D Visibility Representations by Regular Polygons
• Visibility-driven skeleton extraction from unstructured points
• Efficient algorithms for computing a complete visibility region in three-dimensional space
• A Visibility Representation for Graphs in Three Dimensions
• Skeletonization and Distance Transforms of 3D Volumes Using Graphics Hardware

Cited in

(6)

• Visibility maps of segments and triangles in 3D
• Bounding linear head reduction and visible interaction through skeletons
• A succinct 3D visibility skeleton
• 3D Visibility Representations by Regular Polygons
• The Expected Number of 3D Visibility Events Is Linear
• Visibility Maps of Segments and Triangles in 3D

This page was built for publication: On the Computation of 3D Visibility Skeletons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578347)