A multiphase approach to efficient surface simplification

We present a new multiphase method for efficiently simplifying polygonal surface models of arbitrary size. It operates by combining an initial out-of-core uniform clustering phase with a subsequent in-core iterative edge contraction phase. These two phases are both driven by quadric error metrics, and quadrics are used to pass information about the original surface between phases. The result is a method that produces approximations of a quality comparable to quadric-based iterative edge contraction, but at a fraction of the cost in terms of running time and memory consumption.

[1]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

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

[3]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

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

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

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

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

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

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

[10]  Hugues Hoppe.  Smooth view-dependent level-of-detail control and its application to terrain rendering , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

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

[12]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

[13]  Michael Garland,et al.  Multiresolution Modeling: Survey and Future Opportunities , 1999, Eurographics.

[14]  M. Garland,et al.  Multiresolution Modeling: Survey & Future Opportunities , 1999 .

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

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

[17]  Christopher G. Prince.  Progressive Meshes for Large Models of Arbitrary Topology , 2000 .

[18]  Peter Lindstrom,et al.  Out-of-core simplification of large polygonal models , 2000, SIGGRAPH.

[19]  Michael Garland,et al.  Efficient adaptive simplification of massive meshes , 2001, Proceedings Visualization, 2001. VIS '01..

[20]  Cláudio T. Silva,et al.  A memory insensitive technique for large model simplification , 2001, Proceedings Visualization, 2001. VIS '01..