Walkthrough in complex environments at interactive rates using level-of-detail

One of the biggest problems in computer graphics is displaying huge geometric models at interactive rates. A lot of work has been done to achieve the required frame-rates in architecture, simulation, computer-aided design and entertainment applications. In this paper, a system that enables walkthrough in complex environments using level-of-detail approximations is explained. The system uses hierarchical triangulated models as input. In the preprocessing phase, multiresolution models of objects are created using polygonal simplification techniques. During walkthrough, fast frustum culling based on bounding boxes is performed to eliminate branches of hierarchy that are not visible. An appropriate level for detail of objects is selected and displayed depending on the distance of the objects to the camera. For far nodes in the hierarchy, geometric data in lower levels is ignored and textured bounding boxes are displayed. The system achieves interactive frame rates for moderately complex models containing up to a million polygons.

[1]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

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

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

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

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

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

[7]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[8]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[9]  David Salesin,et al.  Fast Rendering of Complex Environments Using a Spatial Hierarchy , 1996, Graphics Interface.

[10]  Charles D. Hansen,et al.  Geometric optimization , 1993, Proceedings Visualization '93.

[11]  Peter Shirley,et al.  Rendering, Complexity, and Perception , 1995 .

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

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

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

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

[16]  Carlo H. Séquin,et al.  Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.

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

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

[19]  Salim Belblidia,et al.  Generating various levels of detail of architectural objects for image-quality and frame-rate control rendering , 1996, Proceedings of CG International '96.

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