A local/global approach to mesh parameterization

L Liu, L Zhang, Y Xu, C Gotsman… - Computer graphics …, 2008 - Wiley Online Library
Computer graphics forum, 2008Wiley Online Library
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, eg similarities or rotations,
generating different types of parameterizations. In the first case, the parameterization tries to …
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.
Wiley Online Library