Consistent mesh parameterizations

A basic element of Digital Geometry Processing algorithms is the establishment of a smooth parameterization for a given model. In this paper we propose an algorithm which establishes parameterizations for a set of models. The parameterizations are called consistent because they share the same base domain and respect features. They give immediate correspondences between models and allow remeshes with the same connectivity. Such remeshes form the basis for a large class of algorithms, including principal component analysis, wavelet transforms, detail and texture transfer between models, and n-way shape blending. We demonstrate the versatility of our algorithm with a number of examples.

[1]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[2]  John F. Hughes,et al.  Scheduled Fourier volume morphing , 1992, SIGGRAPH.

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

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

[5]  Michael S. Floater,et al.  Parametrization and smooth approximation of surface triangulations , 1997, Comput. Aided Geom. Des..

[6]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

[7]  David P. Dobkin,et al.  Multiresolution mesh morphing , 1999, SIGGRAPH.

[8]  Ergun Akleman,et al.  Guaranteeing 2-manifold property for meshes , 1999, Proceedings Shape Modeling International '99. International Conference on Shape Modeling and Applications.

[9]  Peter Schröder,et al.  Normal meshes , 2000, SIGGRAPH.

[10]  Andrei Khodakovsky,et al.  Progressive geometry compression , 2000, SIGGRAPH.

[11]  Steve Marschner,et al.  Modeling and Rendering for Realistic Facial Animation , 2000, Rendering Techniques.