Download:
|
by David Luebke, Carl Erikson
http://www.cs.unc.edu/~walk/papers/luebke/postscript/sig97_paper.ps.gz
Add To MetaCart
Abstract:
Hierarchical dynamic simplification (HDS) is a new approach to the problem of simplifying arbitrary polygonal environments. HDS operates dynamically, retessellating the scene continuously as the user's viewing position shifts, and adaptively, processing the entire database without first decomposing the environment into individual objects. The resulting system allows real-time display of very complex polygonal CAD models consisting of thousands of parts and hundreds of thousands of polygons. HDS supports various preprocessing algorithms and various run-time criteria, providing a general framework for dynamic viewdependent simplification. Briefly, HDS works by clustering vertices together in a hierarchical fashion. The simplification process continuously queries this hierarchy to generate a scene containing only those polygons that are important from the current viewpoint. When the volume of space associated with a vertex cluster occupies less than a user-specified amount of the screen, all vertices within that cluster are collapsed together and degenerate polygons filtered out. HDS maintains an active list of visible polygons for rendering. Since frame-to-frame movements typically involve small changes in viewpoint, and therefore modify the active list by only a few polygons, the method takes advantage of temporal coherence for greater speed.
Citations
|
883
|
Progressive meshes
– Hoppe
- 1996
|
|
417
|
Multiresolution Analysis of Arbitrary Meshes
– Eck, DeRose, et al.
- 2002
|
|
374
|
Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments
– Funkhouser, Sequin
- 1993
|
|
364
|
Re-tiling polygonal surfaces
– TURK
- 1992
|
|
307
|
Multi-resolution 3D approxima-tions for rendering complex scenes. In Modeling in Computer Graphics: Methods and Applications
– ROSSIGNAC, BORREL
- 1993
|
|
279
|
Hierarchical geometric models for visible surface algorithms
– CLARK
- 1976
|
|
277
|
Visibility Preprocessing for Interactive Walkthroughs
– Teller, Sequin
- 1991
|
|
266
|
IRIS Performer: A High Performance Multiprocessing Toolkit for Real-Time 3D Graphics
– Rohlf, Helman
|
|
176
|
Visual Navigation of Large Environments Using Textured Clusters
– Maciel, Shirley
- 1995
|
|
159
|
Simplification Envelopes
– Cohen, Varshney, et al.
- 1996
|
|
144
|
and A.Varshney, “Dynamic Viewdependent Simplification for Polygonal Models
– Xia
|
|
37
|
The cone of normals technique for fast processing of curved patches
– Shirman, Abi-Ezzi
- 1993
|
|
30
|
GazeDirected Adaptive Rendering for Interacting with Virtual Space
– Ohshima, Yamamoto, et al.
- 1996
|
|
23
|
Hierarchical Structures for Dynamic Polygonal Simplification
– Luebke
- 1996
|
|
21
|
Voxel-Based Object Simplification
– He, Hong, et al.
- 1995
|
|
20
|
Hierarchical back-face computation
– Kumar, Manocha, et al.
- 1996
|
|
16
|
System strategies to optimize CIG image content
– Cosman, Schumacker
- 1981
|
|
8
|
System Strategies to Optimize CIG
– Cosman, Schumacker
- 1981
|
|
4
|
Improved Specular Highlights with Adaptive Shading
– Cho, Neumann, et al.
- 1996
|
|
4
|
The Cone of Normals Technique for Fast Processing
– Shirman, Abi-Ezzi
- 1993
|
|
2
|
SGI Performance Tips” (Talk). For more information see: http://www.cs.unc.edu/~aliaga/IR-perf.html
– Aliaga
|
|
2
|
Hierarchical Geometry Approximations
– Varshney
|
|
2
|
SGI Performance Tips" (Talk). For more information see: http://www.cs.unc.edu/~aliaga/IR-perf.html
– Aliaga
|
|
2
|
Zarge and William Lorenson, "Decimation of Triangle Meshes
– Schroeder, Jonathan
|
|
1
|
Hierarchical Geometry Approxim ations
– Varshney
|
|
1
|
and Amitabh Varshney. "Dynamic View-Dependent Simplification for Polygonal Models", Visualization 96
– Xia
|