On the Computation of the 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 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.
Type de document :
Communication dans un congrès
16th Annual International Computing and Combinatorics Conference - COCOON 2010, Jul 2010, Nha Trang, Vietnam. Springer, 2010, Lecture Notes in Computer Science
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00472839
Contributeur : Sylvain Lazard <>
Soumis le : mardi 13 avril 2010 - 13:33:35
Dernière modification le : vendredi 1 juin 2018 - 15:24:01
Document(s) archivé(s) le : mercredi 30 novembre 2016 - 16:40:42

Fichier

COCOON2010.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00472839, version 1

Collections

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. Springer, 2010, Lecture Notes in Computer Science. 〈inria-00472839〉

Partager

Métriques

Consultations de la notice

283

Téléchargements de fichiers

143