Model Simplification Through Refinement

As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplification algorithms are not well suited for this task because they are either too slow (requiring the simplified model to be pre-computed) or produce models that are too poor in quality. These shortcomings become particularly acute when models are extremely large. We present an algorithm suitable for simplification of large models at interactive speeds. The algorithm is fast and can guarantee displayable results within a given time limit. Results also have good quality. Inspired by splitting algorithms from vector quantization literature, we simplify models in reverse, beginning with an extremely coarse approximation and refining it. Approximations of surface curvature guide the simplification process. Previously produced simplifications can be further refined by using them as input to the algorithm.

[1]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

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

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

[4]  Peter Lindstrom,et al.  Fast and memory efficient polygonal simplification , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

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

[6]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[7]  I. T. Jolliffe,et al.  Generalizations and Adaptations of Principal Component Analysis , 1986 .

[8]  M. Garland,et al.  Quadric-Based Polygonal Surface Simplification , 1999 .

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

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

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

[12]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[13]  Arie E. Kaufman,et al.  Voxel based object simplification , 1995, Proceedings Visualization '95.

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

[15]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[16]  Russell H. Taylor,et al.  Superfaces: polygonal mesh simplification with bounded error , 1996, IEEE Computer Graphics and Applications.

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

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

[19]  B. O'neill.  Elementary Differential Geometry , 1966 .

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

[21]  Francis Schmitt,et al.  Mesh Simplification , 1996, Comput. Graph. Forum.

[22]  Dieter Schmalstieg,et al.  Lodestar: an octree-based level of detail generator for VRML , 1997, VRML '97.

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