A Succinct 3D Visibility Skeleton

Sylvain Lazard (1) , Christophe Weibel (2) , Sue Whitesides (3) , Linqiao Zhang

1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
2 Department of Mathematics and Statistics [Montréal]
3 Department of Computer Science [Victoria]

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.

Domaines: Géométrie algorithmique [cs.CG]

Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang. A Succinct 3D Visibility Skeleton. Discrete Mathematics, Algorithms and Applications, 2010, 2 (4), pp.1-23. ⟨10.1142/S1793830910000899⟩. ⟨inria-00511233⟩