Interactive view-dependent rendering with conservative occlusion culling in complex environments

This paper presents an algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of the entire scene is decomposed into a cluster hierarchy through a novel clustering and partitioning algorithm. The cluster hierarchy is then used for view-frustum and occlusion culling. Using hardware accelerated occlusion queries and frame-to-frame coherence, a potentially visible set of clusters is computed. An active vertex front and face list is computed from the visible clusters and rendered using vertex arrays. The integrated algorithm has been implemented on a Pentium IV PC with a NVIDIA GeForce 4 graphics card and applied in two complex environments composed of millions of triangles. The resulting system can render these environments at interactive rates with little loss in image quality and minimal popping artifacts.

[1]  Jihad El-Sana,et al.  Generalized View‐Dependent Simplification , 1999, Comput. Graph. Forum.

[2]  Christopher DeCoro,et al.  XFastMesh: fast view-dependent meshing from external memory , 2002, IEEE Visualization, 2002. VIS 2002..

[3]  Michael Garland,et al.  Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.

[4]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[5]  Neil G. Scott,et al.  An overview of the vi- sualize fx graphics accelerator hardware , 1998 .

[6]  Jihad El-Sana,et al.  Optimized view-dependent rendering for large polygonal datasets , 2002, IEEE Visualization, 2002. VIS 2002..

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

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

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

[10]  M. Meissner,et al.  Generation of Subdivision Hierarchies for Efficient Occlusion Culling of Large Polygonal Models , 1999 .

[11]  Jihad El-Sana,et al.  Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models , 1997, IEEE Trans. Vis. Comput. Graph..

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

[13]  Dinesh Manocha,et al.  GAPS: general and automatic polygonal simplification , 1999, SI3D.

[14]  Dirk Bartz,et al.  Generation of Decomposition Hierarchies for Efficient Occlusion Culling of Large Polygonal Models , 2001, VMV.

[15]  Ned Greene.  Occlusion culling with optimized hierarchical buffering , 1999, SIGGRAPH '99.

[16]  Dinesh Manocha,et al.  Interactive visibility culling in complex environments using occlusion-switches , 2003, I3D '03.

[17]  Cláudio T. Silva,et al.  Integrating occlusion culling with view-dependent rendering , 2001, Proceedings Visualization, 2001. VIS '01..

[18]  Michael Wimmer,et al.  Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs , 2000, Rendering Techniques.

[19]  Daniel G. Aliaga,et al.  MMR: an interactive massive model rendering system using geometric and image-based acceleration , 1999, SI3D.

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

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

[22]  Jihad El-Sana,et al.  External Memory View‐Dependent Simplification , 2000, Comput. Graph. Forum.

[23]  François X. Sillion.  Clustering and Volume Scattering for Hierarchical Radiosity Calculations , 1995 .

[24]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[25]  Peter Lindstrom,et al.  Out-of-core construction and visualization of multiresolution surfaces , 2003, I3D '03.

[26]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

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

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

[29]  Seth J. Teller,et al.  The UC Berkeley System for Interactive Visualization of Large Architectural Models , 1996, Presence: Teleoperators & Virtual Environments.

[30]  Dinesh Manocha,et al.  Interactive shadow generation in complex environments , 2003, ACM Trans. Graph..

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

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

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

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

[35]  Dirk Bartz,et al.  OpenGL-assisted occlusion culling for large polygonal models , 1999, Comput. Graph..

[36]  James T. Klosowski,et al.  iWalk: Interactive Out-Of-Core Rendering of Large Models , 2002 .

[37]  H. Deutsch.  Principle Component Analysis , 2004 .

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

[39]  Renato Pajarola,et al.  FastMesh: efficient view-dependent meshing , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

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

[41]  David P. Luebke,et al.  View-dependent simplification of arbitrary polygonal environments , 1997, SIGGRAPH.