Smoothing an overlay grid to minimize linear distortion in texture mapping

Texture is an essential component of computer generated models. For a texture mapping procedure to be effective it has to generate continuous textures and cause only small mapping distortion. The Angle Based Flattening (ABF) parameterization method is guaranteed to provide a continuous (no foldovers) mapping. It also minimizes the angular distortion of the parameterization, including locating the optimal planar domain boundary. However, since it concentrates on minimizing the angular distortion of the mapping, it can introduce relatively large linear distortion.In this paper we introduce a new procedure for reducing length distortion of an existing parameterization and apply it to ABF results. The linear distortion reduction is added as a second step in a texture mapping computation. The new method is based on computing a mapping from the plane to itself which has length distortion very similar to that of the ABF parameterization. By applying the inverse mapping to the result of the initial parameterization, we obtain a new parameterization with low length distortion. We notice that the procedure for computing the inverse mapping can be applied to any other (convenient) mapping from the three-dimensional surface to the plane in order to improve it.The mapping in the plane is computed by applying weighted Laplacian smoothing to a Cartesian grid covering the planar domain of the initial mapping. Both the mapping and its inverse are provably continuous. Since angle preserving (conformal) mappings, such as ABF, locally preserve distances as well, the planar mapping has small local deformation. As a result, the inverse mapping does not significantly increase the angular distortion.The combined texture mapping procedure provides a mapping with low distance and angular distortion, which is guaranteed to be continuous.

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

[2]  David A. Rottenberg,et al.  Quasi-Conformally Flat Mapping the Human Cerebellum , 1999, MICCAI.

[3]  Pedro V. Sander,et al.  Texture mapping progressive meshes , 2001, SIGGRAPH.

[4]  E. Sturler,et al.  Surface Parameterization for Meshing by Triangulation Flattenin , 2000 .

[5]  Xiaoye S. Li,et al.  SuperLU Users'' Guide , 1997 .

[6]  Alla Sheffer,et al.  Parameterization of Faceted Surfaces for Meshing using Angle-Based Flattening , 2001, Engineering with Computers.

[7]  Bruno Lévy,et al.  Constrained texture mapping for polygonal meshes , 2001, SIGGRAPH.

[8]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[9]  D. Brandt,et al.  Multi-level adaptive solutions to boundary-value problems math comptr , 1977 .

[10]  大野 義夫,et al.  Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .

[11]  W. T. Tutte.  Convex Representations of Graphs , 1960 .

[12]  D. A. Field.  Laplacian smoothing and Delaunay triangulations , 1988 .

[13]  Steven J. Owen,et al.  A Survey of Unstructured Mesh Generation Technology , 1998, IMR.

[14]  Jean-Laurent Mallet,et al.  Discrete smooth interpolation in geometric modelling , 1992, Comput. Aided Des..

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

[16]  A. Sheffer.  Spanning tree seams for reducing parameterization distortion of triangulated surfaces , 2002, Proceedings SMI. Shape Modeling International 2002.

[17]  Adam Finkelstein,et al.  Lapped textures , 2000, SIGGRAPH.

[18]  James Demmel,et al.  A Supernodal Approach to Sparse Partial Pivoting , 1999, SIAM J. Matrix Anal. Appl..

[19]  Bruno Lévy,et al.  Non-distorted texture mapping for sheared triangulated meshes , 1998, SIGGRAPH.

[20]  Jean-Marc Vézien,et al.  Piecewise surface flattening for non-distorted texture mapping , 1991, SIGGRAPH.

[21]  Ron Kimmel,et al.  Texture Mapping Using Surface Flattening via Multidimensional Scaling , 2002, IEEE Trans. Vis. Comput. Graph..

[22]  Alla Sheffer.  Spanning Tree Seams for Reducing Parameterization Distortion of Triangulated Surfaces (figures 4, 5, and 6) , 2002, Shape Modeling International.

[23]  John E. Howland,et al.  Computer graphics , 1990, IEEE Potentials.

[24]  Alla Sheffer,et al.  Spanning Tree Seams for Reducing Parameterization Distortion of Triangulated Surfaces , 2002, Shape Modeling International.

[25]  Jean-Laurent Mallet,et al.  Discrete smooth interpolation , 1989, TOGS.

[26]  J. Eells,et al.  Harmonic Mappings of Riemannian Manifolds , 1964 .

[27]  Nikos A. Aspragathos,et al.  Geodesic curvature preservation in surface flattening through constrained global optimization , 2001, Comput. Aided Des..

[28]  Kai Hormann,et al.  Parameterization of Triangulations and Unorganized Points , 2002, Tutorials on Multiresolution in Geometric Modelling.

[29]  Anne Verroust-Blondet,et al.  Interactive texture mapping , 1993, SIGGRAPH.

[30]  David L. Marcum,et al.  Unstuctured Surface Grid Generation Using Global Mapping and Physical Space Approximation , 1999, IMR.

[31]  Michael S. Floater.  Convex Combination Maps , 2001 .

[32]  K. Hormann,et al.  MIPS: An Efficient Global Parametrization Method , 2000 .

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

[34]  J. McCartney,et al.  The flattening of triangulated surfaces incorporating darts and gussets , 1999, Comput. Aided Des..

[35]  Dani Lischinski,et al.  Bounded-distortion piecewise mesh parameterization , 2002, IEEE Visualization, 2002. VIS 2002..

[36]  A. She.  SURFACE PARAMETERIZATION FOR MESHING BY TRIANGULATION FLATTENING , 2000 .

[37]  W. T. Tutte.  How to Draw a Graph , 1963 .

[38]  J. Eells,et al.  Another Report on Harmonic Maps , 1988 .

[39]  Matthew L. Staten,et al.  An Approach to Combined Laplacian and Optimization-Based Smoothing for Triangular, Quadrilateral, and Quad-Dominant Meshes , 1998, IMR.