Shape-adaptive 3-D 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 local object shape. In this paper, we present a shape-adaptive mesh simplification algorithm that locally maximizes edge length, depending on local shape. The proposed algorithm achieves shape-adaptive simplification by iteratively maximizing edges between vertices, based on comparison with the ‘optimal’ edge lengths derived from local directional curvatures for a given error tolerance. Edge-based processing facilitates the local shape adaptation and preserves sharp features. Experimental results demonstrate the efficacy of the proposed algorithm, by showing good visual quality and extremely small approximation error. Copyright © 2003 John Wiley & Sons, Ltd.

[1]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[2]  David Salomon,et al.  Computer Graphics and Geometric Modeling , 1999, Springer New York.

[3]  Ramesh C. Jain,et al.  Segmentation through Variable-Order Surface Fitting , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

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

[5]  Nasser Khalili,et al.  Curvature Computation on Free-Form 3-D Meshes at Multiple Scales , 2001, Comput. Vis. Image Underst..

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

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

[8]  Gabriel Taubin,et al.  Estimating the tensor of curvature of a surface from a polyhedral approximation , 1995, Proceedings of IEEE International Conference on Computer Vision.

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

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

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

[12]  Bernd Hamann,et al.  Curvature Approximation for Triangulated Surfaces , 1993, Geometric Modelling.

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

[14]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in C , 1991 .

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

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

[17]  Michael Garland,et al.  Optimal triangulation and quadric-based surface simplification , 1999, Comput. Geom..

[18]  Hugues Hoppe,et al.  New quadric metric for simplifying meshes with appearance attributes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[19]  Peter Schröder,et al.  Multiresolution signal processing for meshes , 1999, SIGGRAPH.

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

[21]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in Ada , 1993 .