A Local/Global Approach to Mesh Parameterization

DSpace/Manakin Repository

A Local/Global Approach to Mesh Parameterization

Citable link to this page


Title: A Local/Global Approach to Mesh Parameterization
Author: Gotsman, Craig; Liu, Ligang; Zhang, Lei; Xu, Yin; Gortler, Steven

Note: Order does not necessarily reflect citation order of authors.

Citation: Liu, Ligang, Lei Zhang, Yin Xu, Craig Gotsman, and Steven J. Gortler. 2008. A local/global approach to mesh parameterization. Symposium on Geometry Processing: July 2-4, 2008, Copenhagen, Denmark. Sixth Eurographics/SIGGRAPH symposium on geometry processing. Special Issue, Computer Graphics Forum 27(5): 1495-1504.
Full Text & Related Files:
Abstract: We present a novel approach to parameterize a mesh with disk topology to the plane in a shape-preserving manner. Our key contribution is a local/global algorithm, which combines a local mapping of each 3D triangle to the plane, using transformations taken from a restricted set, with a global "stitch" operation of all triangles, involving a sparse linear system. The local transformations can be taken from a variety of families, e.g. similarities or rotations, generating different types of parameterizations. In the first case, the parameterization tries to force each 2D triangle to be an as-similar-as-possible version of its 3D counterpart. This is shown to yield results identical to those of the LSCM algorithm. In the second case, the parameterization tries to force each 2D triangle to be an as-rigid-as-possible version of its 3D counterpart. This approach preserves shape as much as possible. It is simple, effective, and fast, due to pre-factoring of the linear system involved in the global phase. Experimental results show that our approach provides almost isometric parameterizations and obtains more shape-preserving results than other state-of-the-art approaches. We present also a more general "hybrid" parameterization model which provides a continuous spectrum of possibilities, controlled by a single parameter. The two cases described above lie at the two ends of the spectrum. We generalize our local/global algorithm to compute these parameterizations. The local phase may also be accelerated by parallelizing the independent computations per triangle.
Published Version: http://dx.doi.org/10.1111/j.1467-8659.2008.01290.x
Other Sources: http://www.eg.org/EG/DL/CGF/volume27/issue5/v27i5pp1495-1504.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:2641658

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search