SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Transversals to Line Segments in Three-Dimensional Space
Discrete & Computational Geometry
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing
On the Size of the 3D Visibility Skeleton: Experimental Results
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Technical Section: Analytic ambient occlusion using exact from-polygon visibility
Computers and Graphics
| Hi-index | 0.00 |
The 3D visibility skeleton is a data structure that encodes the global visibility information of a set of 3D objects. While it is useful in answering global visibility queries, its large size often limits its practical use. In this paper, we address this issue by proposing a subset of the visibility skeleton, which is empirically about 25% to 50% of the whole set.We show that the rest of the data structure can be recovered from the subset as needed, partially or completely. The running time complexity, which we analyze in terms of output size, is efficient. We also prove that the subset is minimal in the sense that the complexity bound ceases to hold if the subset is restricted further.