The 3D Visibility Complex: a unified data-structure for global visibility of scenes of polygons and smooth objects - Archive ouverte HAL Access content directly
Conference Papers Year : 1997

The 3D Visibility Complex: a unified data-structure for global visibility of scenes of polygons and smooth objects

, (1) , (1)
1

Abstract

In this paper we describe a unified data-structure, the 3DVisibility Complex which encodes the visibility information of a 3D scene of polygons and smooth convex objects. This datastructure is a partition of the maximal free segments and is based on the characterization of the topological changes of visibility along critical line sets. We show that the size k of the complex is (n) and O(n4) and we give an output sensitive algorithm to build it in time O((n3 + k) log n). This theoretical work has already been used to define a practical data-structure, the Visibility Skeleton described in a companion paper.
Fichier principal
Vignette du fichier
cccg97.pdf (94.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00510106 , version 1 (17-08-2010)

Identifiers

  • HAL Id : inria-00510106 , version 1

Cite

Frédo Durand, George Drettakis, Claude Puech. The 3D Visibility Complex: a unified data-structure for global visibility of scenes of polygons and smooth objects. 9th Canadian Conference on Computational Geometry (CCCG97), Aug 1997, Kingston, Canada. ⟨inria-00510106⟩
79 View
59 Download

Share

Gmail Facebook Twitter LinkedIn More