On the Computation of the 3D Visibility Skeleton

1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 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. Our recovery method is efficient in the sense that it is output-dependent. We also prove that this subset is minimal for the complexity of our recovery method.
Document type :
Conference papers

Cited literature [26 references]

https://hal.inria.fr/inria-00472839
Contributor : Sylvain Lazard <>
Submitted on : Tuesday, April 13, 2010 - 1:33:35 PM
Last modification on : Thursday, June 18, 2020 - 12:32:04 PM
Document(s) archivé(s) le : Wednesday, November 30, 2016 - 4:40:42 PM

File

COCOON2010.pdf
Files produced by the author(s)

Identifiers

• HAL Id : inria-00472839, version 1

Citation

Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang. On the Computation of the 3D Visibility Skeleton. 16th Annual International Computing and Combinatorics Conference - COCOON 2010, Jul 2010, Nha Trang, Vietnam. ⟨inria-00472839⟩

Record views