Simplification Culling of Static and Dynamic Scene Graphs

We present a new approach for simplifying large polygonal environments composed of hundreds or thousands of objects. Our algorithm represents the environment using a scene graph and automatically computes levels of detail (LOD) for each node in the graph. For drastic simplification, the algorithm uses hierarchical levels of detail (HLOD) to represent the simplified geometry of whole portions of the scene graph. When HLOD are rendered, the algorithm can ignore these portions, thereby performing simplification culling. For dynamic environments, HLOD are incrementally computed on the fly. The algorithm is applicable to all models and involves no user intervention. It generates high quality and drastic simplifications and has been applied to CAD models composed of hundreds of thousands of polygons. In practice, it achieves significant speedups in rendering large static and dynamic environments with little loss in image quality.

[1]  Dinesh Manocha,et al.  Simplifying polygonal models using successive mappings , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[2]  W. Stürzlinger,et al.  Generating Multiple Levels of Detail from Polygonal Geometry Models , 1995, Virtual Environments.

[3]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[4]  Jihad El-Sana,et al.  Controlled simplification of genus for polygonal models , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[5]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[6]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

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

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

[9]  Daniel G. Aliaga.  Visualization of complex models using dynamic texture-based simplification , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[10]  Jarek Rossignac,et al.  BRUSH as a Walkthrough System for Architectural Models , 1995 .

[11]  Russell H. Taylor,et al.  Superfaces: polyhedral approximation with bounded error , 1994, Medical Imaging.

[12]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[13]  Chandrajit L. Bajaj,et al.  Error-bounded reduction of triangle meshes with multivariate data , 1996, Electronic Imaging.

[14]  Christopher M. Gold.  Dynamic spatial data structures--the Voronoi approach , 1992 .

[15]  Kok-Lim Low,et al.  Model simplification using vertex-clustering , 1997, SI3D.

[16]  Enric Torres,et al.  Optimization of the Binary Space Partition Algorithm (BSP) for the Visualization of Dynamic Scenes , 1990, Eurographics.

[17]  Robin Liggett,et al.  An environment for real-time urban simulation , 1995, I3D '95.

[18]  Rémi Ronfard,et al.  Full‐range approximation of triangulated polyhedra. , 1996, Comput. Graph. Forum.

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

[20]  Michael T. Goodrich,et al.  Dynamic trees and dynamic point location , 1991, STOC '91.

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

[22]  Peter Shirley,et al.  Visual navigation of large environments using textured clusters , 1995, I3D '95.

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

[24]  Denis Laurendeau,et al.  Multiresolution Surface Modeling Based on Hierarchical Triangulation , 1996, Comput. Vis. Image Underst..

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

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

[27]  George Drettakis,et al.  Interactive update of global illumination using a line-space hierarchy , 1997, SIGGRAPH.

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

[29]  Jovan Popovic,et al.  Progressive simplicial complexes , 1997, SIGGRAPH.

[30]  David Salesin,et al.  Hierarchical image caching for accelerated walkthroughs of complex environments , 1996, SIGGRAPH.

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

[32]  Mikhail J. Atallah,et al.  Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[33]  Bernd Hamann,et al.  A data reduction scheme for triangulated surfaces , 1994, Comput. Aided Geom. Des..

[34]  William J. Schroeder.  A topology modifying progressive decimation algorithm , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[35]  Dinesh Manocha,et al.  Accelerated walkthrough of large spline models , 1997, SI3D.

[36]  Jarek Rossignac,et al.  Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[37]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[38]  Amitabh Varshney,et al.  Controlled Topology Simplification , 1996, IEEE Trans. Vis. Comput. Graph..

[39]  Alyn P. Rockwood,et al.  Real-time rendering of trimmed surfaces , 1989, SIGGRAPH.

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