Hoops: 3D Curves as Conservative Occluders for Cell‐Visibility

Most visibility culling algorithms require convexity of occluders. Occluder synthesis algorithms attempt to construct large convex occluders inside bulky non‐convex sets. Occluder fusion algorithms generate convex occluders that are contained in the umbra cast by a group of objects given an area light. In this paper we prove that convexity requirements can be shifted from the occluders to their umbra with no loss of efficiency, and use this property to show how some special non‐planar, non‐convex closed polylines that we call “hoops” can be used to compute occlusion efficiently for objects that have no large interior convex sets and were thus rejected by previous approaches.

[1]  François X. Sillion,et al.  Conservative volumetric visibility with occluder fusion , 2000, SIGGRAPH.

[2]  Seth J. Teller,et al.  Temporally coherent conservative visibility , 1999, Comput. Geom..

[3]  Carlos Andújar,et al.  Integrating Occlusion Culling and Levels of Detail through Hardly‐Visible Sets , 2000, Comput. Graph. Forum.

[4]  Gavin S. P. Miller,et al.  Hierarchical Z-buffer visibility , 1993, SIGGRAPH.

[5]  Pere Brunet,et al.  The visibility octree: a data structure for 3D navigation , 1999, Comput. Graph..

[6]  Daniel Cohen-Or,et al.  Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes , 1998, Comput. Graph. Forum.

[7]  Jihad El-Sana,et al.  Directional Discretized Occluders for Accelerated Occlusion Culling , 2000, Comput. Graph. Forum.

[8]  Cláudio T. Silva,et al.  Rendering on a budget: a framework for time-critical rendering , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[9]  Frédo Durand,et al.  3d visibility: analytical study and applications , 1999 .

[10]  Daniel Cohen-Or,et al.  Virtual Occluders: An Efficient Intermediate PVS Representation , 2000, Rendering Techniques.

[11]  Tiow Seng Tan,et al.  Preprocessing occlusion for real-time selective refinement , 1999, SI3D.

[12]  Carlos Andújar,et al.  LOD visibility culling and occluder synthesis , 2000, Comput. Aided Des..

[13]  Seth J. Teller,et al.  Global visibility algorithms for illumination computations , 1993, SIGGRAPH.

[14]  Seth J. Teller,et al.  Real-time occlusion culling for models with large occluders , 1997, SI3D.

[15]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[16]  Joëlle Thollot,et al.  Conservative visibility preprocessing using extended projections , 2000, SIGGRAPH.

[17]  Hansong Zhang,et al.  Effective occlusion culling for the interactive display of arbitrary models , 1998 .

[18]  Carlo H. Séquin,et al.  Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.

[19]  Dinesh Manocha,et al.  Visibility culling using hierarchical occlusion maps , 1997, SIGGRAPH.

[20]  Dinesh Manocha,et al.  Accelerated occlusion culling using shadow frusta , 1997, SCG '97.