Tubular triangular mesh parameterization and applications

Triangular meshes are a popular geometric representation for 3D models used in computer graphics. Parameterization is a process that establishes a mapping between the surface of a model and a suitable domain. This paper considers the problem of parameterizing triangular meshes that have tubular shapes. Unlike an open mesh that is of plane topological type, a tubular mesh gives rise to some special issues in parameterization due to its mesh structure. This paper presents an edge-based parameterization method, in which the edges rather than the vertices of the mesh are treated as the target for parameterization. It first parameterizes the edges on the two boundaries of the tubular mesh, then parameterizes the internal edges based on the mean value coordinates, and finally computes the parameters of the mesh vertices. The method does not need cutting of the mesh. It improves conventional cutting-based algorithms, which cut the mesh to make it a disk topologically, and overcomes the problems of cutting paths that are the zigzag paths leading to suboptimal parameterizations and the difficulty in finding good cutting paths. Some applications such as surface fitting and texture mapping are also provided. Copyright © 2009 John Wiley & Sons, Ltd. This paper presents an edge-based method for parameterizing tubular triangular meshes, in which the edges rather than the vertices of the mesh are treated as the target for parameterization. The method does not need cutting of the mesh and thus overcomes some problems existing in conventional cutting-based algorithms.

[1]  Reinhard Klein,et al.  An Adaptable Surface Parameterization Method , 2003, IMR.

[2]  Hans-Christian Hege,et al.  Fast and intuitive generation of geometric shape transitions , 2000, The Visual Computer.

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

[4]  Jianmin Zheng,et al.  Adaptive T-spline surface approximation of triangular meshes , 2007, 2007 6th International Conference on Information, Communications & Signal Processing.

[5]  Henk A. van der Vorst,et al.  Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[6]  Martin Rumpf,et al.  Axioms and variational problems in surface parameterization , 2004, Comput. Aided Geom. Des..

[7]  Bruno Lévy,et al.  ABF++: fast and robust angle based flattening , 2005, TOGS.

[8]  Kevin Weiler,et al.  Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments , 1985, IEEE Computer Graphics and Applications.

[9]  Nicholas S. North,et al.  T-spline simplification and local refinement , 2004, SIGGRAPH 2004.

[10]  Alexei Sourin,et al.  Function-based representation of complex geometry and appearance , 2005, Web3D '05.

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

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

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

[14]  Yimin Wang,et al.  Adaptive T-spline surface fitting to z-map models , 2005, GRAPHITE '05.

[15]  Ahmad H. Nasri,et al.  T-splines and T-NURCCs , 2003, ACM Trans. Graph..

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