The 3D Visibility Complex - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Graphics Year : 2002

The 3D Visibility Complex


Visibility problems are central to many computer graphics applications. The most common examples include hidden-part removal for view computation, shadow boundaries, mutual visibility of objects for lighting simulation. In this paper, we present a theoretical study of 3D visibility properties for scenes of smooth convex objects. We work in the space of light rays, or more precisely, of maximal free segments. We group segments that "see" the same object; this defines the 3D visibility complex. The boundaries of these groups of segments correspond to the visual events of the scene (limits of shadows, disappearance of an object when the viewpoint is moved, etc.). We provide a worst case analysis of the complexity of the visibility complex of 3D scenes, as well as a probabilistic study under a simple assumption for "normal" scenes. We extend the visibility complex to handle temporal visibility. We give an output-sensitive construction algorithm and present applications of our approach.
Fichier principal
Vignette du fichier
cplx3d.pdf (941.51 Ko) Télécharger le fichier
Vignette du fichier
tritg.jpg (122.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

inria-00606717 , version 1 (26-07-2011)



Frédo Durand, George Drettakis, Claude Puech. The 3D Visibility Complex. ACM Transactions on Graphics, 2002, 21 (2), pp.176-206. ⟨10.1145/508357.508362⟩. ⟨inria-00606717⟩
136 View
268 Download



Gmail Facebook X LinkedIn More