Locally Linear Isometric Parameterization
A general algorithm framework for 3D mesh parametrization is proposed in this paper. Under this framework, a parametrization algorithm is divided into three steps. In the first step, the linearly reconstructing weights of each vertex with respect to its neighbours are computed. These weights are then used to computed a initial parametrization mesh, and in the third step, this initial mesh is rotated and scaled to obtain a parametrization mesh with high isometric precision. Four parametrization algorithms are proposed based on this framework. Examples show the effectiveness and applicability of the parametrization algorithms proposed in the paper.
KeywordsTriangular Mesh Geodesic Distance Parametrization Algorithm Texture Mapping Boundary Vertex
Unable to display preview. Download preview PDF.
- 1.Borg, I., Groenen, P.: Modern Multidimensional Scaling Theory and Application. Springer, Heidelberg (1997)Google Scholar
- 4.Floater, M.S., Hormann, K.: Surface parameterization: a tutorial and survey. In: Dodgson, N.A., Floater, M.S., Sabin, M.A. (eds.) Advances in Multiresolution for Geometric Modelling, pp. 157–186. Springer, Heidelberg (2004)Google Scholar
- 7.Saul, L.K., Roweis, S.T.: An introduction to locally linear embedding. Technical report, AT & T Labs-Research (2000)Google Scholar
- 12.Welch, W., Witkin, A.: Free-form shape design using triangulated surfaces. In: Computer Graphics, SIGGRAPH 1994, pp. 247–256 (1994)Google Scholar