Image-Driven Mesh Optimization

We describe a method of improving the appearance of a low vertex count mesh in a manner that is guided by rendered images of the original, detailed mesh. This approach is motivated by the fact that greedy simplification methods often yield meshes that are poorer than what can be represented with a given number of vertices. Our approach relies on edge swaps and vertex teleports to alter the mesh connectivity, and uses the downhill simplex method to simultaneously improve vertex positions and surface attributes. Note that this is not a simplification method—the vertex count remains the same throughout the optimization. At all stages of the optimization the changes are guided by a metric that measures the differences between rendered versions of the original model and the low vertex count mesh. This method creates meshes that are geometrically faithful to the original model. Moreover, the method takes into account more subtle aspects of a model such as surface shading or whether cracks are visible between two interpenetrating parts of the model.

[1]  Bob Francis,et al.  Silicon Graphics Inc. , 1993 .

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

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

[4]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

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

[6]  Amitabh Varshney,et al.  Dynamic view-dependent simplification for polygonal models , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[7]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

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

[9]  Jeffrey Lubin,et al.  A VISUAL DISCRIMINATION MODEL FOR IMAGING SYSTEM DESIGN AND EVALUATION , 1995 .

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

[11]  David Banks,et al.  Image-guided streamline placement , 1996, SIGGRAPH.

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

[13]  Greg Turk,et al.  Image-driven simplification , 2000, TOGS.

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

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

[16]  Gary W. Meyer,et al.  A perceptually based adaptive sampling algorithm , 1998, SIGGRAPH.

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

[18]  Greg Turk,et al.  Fast and memory efficient polygonal simplification , 1998 .

[19]  William H. Press,et al.  Numerical recipes in C , 2002 .

[20]  Donald P. Greenberg,et al.  A perceptually based physical error metric for realistic image synthesis , 1999, SIGGRAPH.

[21]  Tom Davis,et al.  Opengl programming guide: the official guide to learning opengl , 1993 .

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