New quadric metric for simplifying meshes with appearance attributes

Complex triangle meshes arise naturally in many areas of computer graphics and visualization. Previous work has shown that a quadric error metric allows fast and accurate geometric simplification of meshes. This quadric approach was recently generalized to handle meshes with appearance attributes. In this paper we present an improved quadric error metric for simplifying meshes with attributes. The new metric, based on geometric correspondence in 3D, requires less storage, evaluates more quickly, and results in more accurate simplified meshes. Meshes often have attribute discontinuities, such as surface creases and material boundaries, which require multiple attribute vectors per vertex. We show that a wedge-based mesh data structure captures such discontinuities efficiently and permits simultaneous optimization of these multiple attribute vectors. In addition to the new quadric metric, we experiment with two techniques proposed in geometric simplification, memoryless simplification and volume preservation, and show that both of these are beneficial within the quadric framework. The new scheme is demonstrated on a variety of meshes with colors and normals.

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

[2]  Makoto Maruya.  Generating a Texture Map from Object‐Surface Texture Data , 1995, Comput. Graph. Forum.

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

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

[5]  David Salesin,et al.  Interactive multiresolution surface viewing , 1996, SIGGRAPH.

[6]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[7]  Marc Levoy,et al.  Fitting smooth surfaces to dense polygon meshes , 1996, SIGGRAPH.

[8]  Chandrajit L. Bajaj,et al.  Error-bounded reduction of triangle meshes with multivariate data , 1996, Electronic Imaging.

[9]  Marc Rioux,et al.  A texture-mapping approach for the compression of colored 3D triangulations , 1996, The Visual Computer.

[10]  J. Cohen,et al.  Simplifying polygonal models using successive mappings , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

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

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

[13]  Hans-Peter Seidel,et al.  A General Framework for Mesh Decimation , 1998, Graphics Interface.

[14]  Paolo Cignoni,et al.  A general method for preserving attribute values on simplified meshes , 1998 .

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

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

[17]  Hugues Hoppe,et al.  Efficient implementation of progressive meshes , 1998, Comput. Graph..

[18]  A general method for preserving attribute values on simplified meshes , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[19]  Simplifying surfaces with color and texture using quadric error metrics , 1998, VIS '98.

[20]  Greg Turk,et al.  Fast and memory efficient polygonal simplification , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).