dPVS: an occlusion culling system for massive dynamic environments

A platform-independent occlusion culling library for dynamic environments, dPVS, can benefit such applications as CAD and modeling tools, time-varying simulations, and computer games. Visibility optimization is currently the most effective technique for improving rendering performance in complex 3D environments. The primary reason for this is that during each frame the pixel processing subsystem needs to determine the visibility of each pixel individually. Currently, rendering performance in larger scenes is input sensitive, and most of the processing time is wasted on rendering geometry not visible in the final image. Here we concentrate on real-time visualization using mainstream graphics hardware that has a z-buffer as a de facto standard for hidden surface removal. In an ideal system only the complexity of the geometry actually visible on the screen would significantly impact rendering time - 3D application performance should be output sensitive.

[1]  Werner Purgathofer,et al.  Real-Time Occlusion Culling with a Lazy Occlusion Grid , 2001, Rendering Techniques.

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

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

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

[5]  William V. Baxter,et al.  GigaWalk: Interactive Walkthrough of Complex Environments , 2002, Rendering Techniques.

[6]  David P. Luebke,et al.  Portals and mirrors: simple, fast evaluation of potentially visible sets , 1995, I3D '95.

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

[8]  Kellogg S. Booth,et al.  Heuristics for ray tracing using space subdivision , 1990, The Visual Computer.

[9]  Pedro V. Sander,et al.  Silhouette clipping , 2000, SIGGRAPH.

[10]  Craig Gotsman,et al.  Output‐SensitiveVisibility Algorithms for Dynamic Scenes with Applications to Virtual Reality , 1996, Comput. Graph. Forum.

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

[12]  Cláudio T. Silva,et al.  Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm , 2001, IEEE Trans. Vis. Comput. Graph..

[13]  Anselmo Lastra,et al.  Fast and Simple Occlusion Culling Using Hardware-based Depth Queries , 2002 .

[14]  Michael Wimmer,et al.  Instant Visibility , 2001, Comput. Graph. Forum.

[15]  Peter Wonka,et al.  Occlusion Culling for Real-Time Rendering of Urban Environments , 2001 .