A Succinct 3D Visibility Skeleton

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download


https://hal.inria.fr/inria-00511233
Contributor : Sylvain Lazard <>
Submitted on : Tuesday, August 24, 2010 - 11:30:09 AM
Last modification on : Monday, February 11, 2019 - 4:40:02 PM

Files

succinctvisi-dmaa.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

442

Files downloads

272