论文信息 - A new mesh simplification algorithm based on triangle collapses

A new mesh simplification algorithm based on triangle collapses

In this paper a new mesh simplification algorithm based on triangle collapses is presented. The algorithm can provide efficient error management and simplify the original mesh greatly. Progressive meshes may be constructed with triangle collapsing operation. To make continuous transition between level of detail (LOD) models possible, a method for interpolating is also presented. Examples illustrate the efficiency of the algorithm.

[1] Carl Erikson,et al. Polygonal Simplification: An Overview , 1996 .

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

[3] Michael Zyda,et al. Simplification of objects rendered by polygonal approximations , 1991, Comput. Graph..

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

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

[6] Rynson W. H. Lau,et al. Real-time multi-resolution modeling for complex virtual environments , 1996, VRST '96.

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

[8] Jiaoying Shi,et al. Time-critical computing in virtual environment , 1996, Other Conferences.

[9] Dinesh Manocha,et al. Appearance-preserving simplification , 1998, SIGGRAPH.

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

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

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

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