Skip to main content

A Generalization of the Source Unfolding of Convex Polyhedra

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7579))

Abstract

We present a new method for unfolding a convex polyhedron into one piece without overlap, based on shortest paths to a convex curve on the polyhedron. Our “sun unfoldings” encompass source unfolding from a point, source unfolding from an open geodesic curve, and a variant of a recent method of Itoh, O’Rourke, and Vîlcu.

Dedicated to Ferran Hurtado on the occasion of his 60th birthday.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aronov, B., O’Rourke, J.: Nonoverlap of the star unfolding. Discrete and Computational Geometry 8, 219–250 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Choi, H.I., Choi, S.W., Moon, H.P.: Mathematical theory of medial axis transform. Pacific Journal of Mathematics 181, 57–88 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press (2007)

    Google Scholar 

  4. Ieiri, K., Itoh, J.-I., Vîlcu, C.: Quasigeodesics and farthest points on convex surfaces. Advances in Geometry 11(4), 571–584 (2012)

    MathSciNet  MATH  Google Scholar 

  5. Itoh, J.-I., O’Rourke, J., Vîlcu, C.: Source unfoldings of convex polyhedra with respect to certain closed polygonal curves. In: Proc. 25th European Workshop Comput. Geom. (EuroCG), pp. 61–64 (2009)

    Google Scholar 

  6. Itoh, J.-I., O’Rourke, J., Vîlcu, C.: Star unfolding convex polyhedra via quasigeodesic loops. Discrete and Computational Geometry 44, 35–54 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. O’Rourke, J., Vîlcu, C.: Conical existence of closed curves on convex polyhedra. CoRR, abs/1102.0823 (2011)

    Google Scholar 

  8. O’Rourke, J., Vîlcu, C.: Development of curves on polyhedra via conical existence. In: Proc. 23rd Canadian Conference on Computational Geometry (CCCG), pp. 71–76 (2011)

    Google Scholar 

  9. O’Rourke, J.: Unfolding polyhedra (July 2008)

    Google Scholar 

  10. Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM Journal on Computing 15(1), 193–215 (1986)

    Article  MathSciNet  MATH  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 chapter

Cite this chapter

Demaine, E.D., Lubiw, A. (2012). A Generalization of the Source Unfolding of Convex Polyhedra. In: Márquez, A., Ramos, P., Urrutia, J. (eds) Computational Geometry. EGC 2011. Lecture Notes in Computer Science, vol 7579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34191-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34191-5_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34190-8

  • Online ISBN: 978-3-642-34191-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics