Skip to main content

Efficient Spherical Parametrization Using Progressive Optimization

  • Conference paper
Computational Visual Media (CVM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7633))

Included in the following conference series:

Abstract

Spherical mapping is a key enabling technology in modeling and processing genus-0 close surfaces. A closed genus-0 surface can be seamless parameterized onto a unit sphere. We develop an effective progressive optimization scheme to compute such a parametrization, minimizing a nonlinear energy balancing angle and area distortions. Among all existing state-of-the-art spherical mapping methods, the main advantage of our spherical mapping are two-folded: (1) the algorithm converges very efficiently, therefore it is suitable for handling huge geometric models, and (2) it generates bijective and lowly distorted mapping results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Friedel, I., Schröder, P., Desbrun, M.: Unconstrained spherical parameterization. In: SIGGRAPH Sketches (2005)

    Google Scholar 

  2. Gu, X., Yau, S.T.: Global conformal surface parameterization. In: Proc. Symp. of Geometry Processing, pp. 127–137 (2003)

    Google Scholar 

  3. Hoppe, H.: Progressive meshes. In: SIGGRAPH, pp. 99–108 (1996)

    Google Scholar 

  4. Hormann, K., Greiner, G.: Mips: An efficient global parametrization method. In: Curve and Surface Design: Saint-Malo 1999, pp. 153–162 (2000)

    Google Scholar 

  5. Lee, D.T., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. J. ACM 26(3), 415–421 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  6. Li, X., Bao, Y., Guo, X., Jin, M., Gu, X., Qin, H.: Globally optimal surface mapping for surfaces with arbitrary topology. IEEE Trans. on Visualization and Computer Graphics 14(4), 805–819 (2008)

    Article  Google Scholar 

  7. Li, X., He, Y., Gu, X., Qin, H.: Curves-on-surface: A general shape comparison framework. In: Proc. IEEE International Conf. on Shape Modeling and Applications, pp. 352–357 (2006)

    Google Scholar 

  8. Nocedal, J., Wright, S.J.: Numerical Optimization (2006)

    Google Scholar 

  9. Praun, E., Hoppe, H.: Spherical parametrization and remeshing. ACM Trans. Graph. 22, 340–349 (2003)

    Article  Google Scholar 

  10. Sander, P.V., Snyder, J., Gortler, S.J., Hoppe, H.: Texture mapping progressive meshes. In: SIGGRAPH, pp. 409–416 (2001)

    Google Scholar 

  11. Zayer, R., Rossl, C., Seidel, H.P.: Curvilinear spherical parameterization. In: Proc. IEEE International Conf. on Shape Modeling and Applications (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wan, S., Ye, T., Li, M., Zhang, H., Li, X. (2012). Efficient Spherical Parametrization Using Progressive Optimization. In: Hu, SM., Martin, R.R. (eds) Computational Visual Media. CVM 2012. Lecture Notes in Computer Science, vol 7633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34263-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34263-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34262-2

  • Online ISBN: 978-3-642-34263-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics