Advertisement

Abstract

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.

Keywords

Triangular Mesh Geodesic Distance Parametrization Algorithm Texture Mapping Boundary Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Borg, I., Groenen, P.: Modern Multidimensional Scaling Theory and Application. Springer, Heidelberg (1997)Google Scholar
  2. 2.
    Floater, M.S.: Parametrization and smooth approximation of surface triangulations. Comp. Aided Geom. Design. 14, 231–250 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Floater, M.S.: Mean value coordinates. Comp. Aided Geom. Design 20, 19–27 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 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
  5. 5.
    Praun, E., Hoppe, H.: Spherical parametrization and remeshing. ACM Trans. Graphics. 22, 340–349 (2003)CrossRefGoogle Scholar
  6. 6.
    Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)CrossRefGoogle Scholar
  7. 7.
    Saul, L.K., Roweis, S.T.: An introduction to locally linear embedding. Technical report, AT & T Labs-Research (2000)Google Scholar
  8. 8.
    Saul, L.K., Roweis, S.T.: Think globally, fit locally: unsupervised learning of low dimensional manifolds. Journal of Machine Learning Research 4, 119–155 (2003)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Surazhsky, V., Gotsman, C.: Intrinsic morphing of compatible triangulations. Int. J. Shape Modelling. 9, 191–201 (2003)zbMATHCrossRefGoogle Scholar
  10. 10.
    Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)CrossRefGoogle Scholar
  11. 11.
    Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13, 743–768 (1963)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Welch, W., Witkin, A.: Free-form shape design using triangulated surfaces. In: Computer Graphics, SIGGRAPH 1994, pp. 247–256 (1994)Google Scholar
  13. 13.
    Zigelman, G., Kimmel, R., Kiryati, N.: Texture mapping using surface flattening via multi-dimensional scaling. IEEE Trans. Visualization Comp. Graphics 8, 198–207 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Xianfang Sun
    • 1
    • 2
  • Edwin R. Hancock
    • 2
  1. 1.School of Automation Science and Electrical EngineeringBeihang UniversityBeijingP.R. China
  2. 2.Department of Computer ScienceThe University of YorkYorkUK

Personalised recommendations