Shape-adaptive 3D mesh simplification based on local optimality measurement

Mesh simplification is the process of reducing the number of triangles in a mesh representation of object surface. For a given level of detail or error tolerance, the conventional mesh simplification algorithms maximize the edge length globally, without explicitly considering the local object shape. In this paper we present a shape-adaptive mesh simplification algorithm that locally maximizes the edge length, depending on the local shape. The proposed algorithm achieves shape-adaptive simplification by iteratively maximizing edges between vertices, based on a comparison with the "optimal" edge lengths derived from local directional curvatures for a given error tolerance.

[1]  Martial Hebert,et al.  Control of Polygonal Mesh Resolution for 3-D Computer Vision , 1998, Graph. Model. Image Process..

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

[3]  Michael Garland,et al.  Simplifying surfaces with color and texture using quadric error metrics , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[4]  Hans-Peter Seidel,et al.  Interactive multi-resolution modeling on arbitrary meshes , 1998, SIGGRAPH.

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

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

[7]  André Guéziec,et al.  Locally Toleranced Surface Simplification , 1999, IEEE Trans. Vis. Comput. Graph..

[8]  Peter Lindstrom,et al.  Evaluation of Memoryless Simplification , 1999, IEEE Trans. Vis. Comput. Graph..

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