Parametrization of Meshes

Many algorithms rely on mesh parametrization. In particular, the mapping from a mesh to a 2D domain (and vice versa) is essential to rendering 3D models and an essential component of e.g. remeshing. In this chapter, we study several algorithms for such flattening of a patch of disk topology. The basic algorithm—quite similar to mesh smoothing—is introduced, and various vertex weights are covered, ranging from simple uniform weights to mean value and harmonic weights which result in less distortion. Finally, we discuss the so called natural boundary conditions which allow us to flatten the mesh with minimum angle distortion in the least squares sense.

[1]  Bruno Lévy,et al.  Least squares conformal maps for automatic texture atlas generation , 2002, ACM Trans. Graph..

[2]  Otto Forster,et al.  Lectures on Riemann Surfaces , 1999 .

[3]  Kai Hormann,et al.  Surface Parameterization: a Tutorial and Survey , 2005, Advances in Multiresolution for Geometric Modelling.

[4]  Mark Meyer,et al.  Interactive geometry remeshing , 2002, SIGGRAPH.

[5]  Ulrich Pinkall,et al.  Computing Discrete Minimal Surfaces and Their Conjugates , 1993, Exp. Math..

[6]  Pierre Alliez,et al.  Spectral Conformal Parameterization , 2008, Comput. Graph. Forum.

[7]  Hugues Hoppe,et al.  Spherical parametrization and remeshing , 2003, ACM Trans. Graph..

[8]  M. Floater Mean value coordinates , 2003, Computer Aided Geometric Design.

[9]  Konrad Polthier,et al.  QuadCover ‐ Surface Parameterization using Branched Coverings , 2007, Comput. Graph. Forum.

[10]  Pierre Alliez,et al.  Polygon Mesh Processing , 2010 .

[11]  Mark Meyer,et al.  Intrinsic Parameterizations of Surface Meshes , 2002, Comput. Graph. Forum.

[12]  Neil A. Dodgson,et al.  Advances in Multiresolution for Geometric Modelling , 2005 .

[13]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .