A low dimensional framework for exact polygon-to-polygon occlusion queries

Despite the importance of from-region visibility computation in computer graphics, efficient analytic methods are still lacking in the general 3D case. Recently, different algorithms have appeared that maintain occlusion as a complex of polytopes in Plücker space. However, they suffer from high implementation complexity, as well as high computational and memory costs, limiting their usefulness in practice. In this paper, we present a new algorithm that simplifies implementation and computation by operating only on the skeletons of the polyhedra instead of the multi-dimensional face lattice usually used for exact occlusion queries in 3D. This algorithm is sensitive to complexity of the silhouette of each occluding object, rather than the entire polygonal mesh of each object. An intelligent feedback mechanism is presented that greatly enhances early termination by searching for apertures between query polygons. We demonstrate that our technique is several times faster than the state of the art.

[1]  Frédo Durand,et al.  The 3D Visibility Complex: A New Approach to the Problems of Accurate Visibility , 1996, Rendering Techniques.

[2]  Lilian Aveneau,et al.  Coherent and Exact Polygon-to-Polygon Visibility , 2005, WSCG.

[3]  Vlastimil Havran,et al.  Hierarchical visibility culling with occlusion trees , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[4]  Timo Aila,et al.  dPVS: an occlusion culling system for massive dynamic environments , 2004, IEEE Computer Graphics and Applications.

[5]  Jarek Rossignac,et al.  ShieldTester: Cell‐to‐Cell Visibility Test for Surface Occluders , 2003, Comput. Graph. Forum.

[6]  David M. Mount,et al.  Data structures for global illumination computation and visibility queries in 3-space , 1998 .

[7]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[8]  Michael Wimmer,et al.  Visibility preprocessing for urban scenes using line space subdivision , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

[9]  Shaun Nirenstein.  Fast and Accurate Visibility Preprocessing , 2003 .

[10]  Frédo Durand,et al.  The visibility skeleton: a powerful and efficient multi-purpose global visibility tool , 1997, SIGGRAPH.

[11]  Daniel Cohen-Or,et al.  Hardware-Accelerated from-Region Visibility Using a Dual Ray Space , 2001, Rendering Techniques.

[12]  John R. Wallace,et al.  Shaft Culling for Efficient Ray-Cast Radiosity , 1994 .

[13]  Valerio Pascucci,et al.  Splitting a complex of convex polytopes in any dimension , 1996, SCG '96.

[14]  Edwin H. Blake,et al.  Exact From-Region Visibility Culling , 2002, Rendering Techniques.

[15]  Komei Fukuda,et al.  Combinatorial Face Enumeration in Convex Polytopes , 1994, Comput. Geom..

[16]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[17]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[18]  Edwin H. Blake,et al.  Hardware Accelerated Visibility Preprocessing using Adaptive Sampling , 2004, Rendering Techniques.

[19]  Cláudio T. Silva,et al.  The Prioritized-Layered Projection Algorithm for Visible Set Estimation , 2000, IEEE Trans. Vis. Comput. Graph..

[20]  Seth J. Teller,et al.  Computing the antipenumbra of an area light source , 1992, SIGGRAPH.

[21]  Beverly Sackler,et al.  Ray Space Factorization for From-Region Visibility , 2002 .

[22]  Spyros G. Tzafestas,et al.  Occlusion Culling Algorithms: A Comprehensive Survey , 2002, J. Intell. Robotic Syst..

[23]  Samuli Laine.  A general algorithm for output-sensitive visibility preprocessing , 2005, I3D '05.

[24]  Ji ˇ ´ Bittner,et al.  Hierarchical Techniques for Visibility Computations , 2002 .