Advertisement

A Generalization of the Source Unfolding of Convex Polyhedra

  • Erik D. Demaine
  • Anna Lubiw
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Short Path Line Segment Negative Curvature Convex Polyhedron Convex Curve 
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.
    Aronov, B., O’Rourke, J.: Nonoverlap of the star unfolding. Discrete and Computational Geometry 8, 219–250 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Choi, H.I., Choi, S.W., Moon, H.P.: Mathematical theory of medial axis transform. Pacific Journal of Mathematics 181, 57–88 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press (2007)Google Scholar
  4. 4.
    Ieiri, K., Itoh, J.-I., Vîlcu, C.: Quasigeodesics and farthest points on convex surfaces. Advances in Geometry 11(4), 571–584 (2012)MathSciNetzbMATHGoogle Scholar
  5. 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. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    O’Rourke, J., Vîlcu, C.: Conical existence of closed curves on convex polyhedra. CoRR, abs/1102.0823 (2011)Google Scholar
  8. 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. 9.
    O’Rourke, J.: Unfolding polyhedra (July 2008)Google Scholar
  10. 10.
    Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM Journal on Computing 15(1), 193–215 (1986)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Erik D. Demaine
    • 1
  • Anna Lubiw
    • 2
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA
  2. 2.David R. Cheriton School of Computer ScienceUniversity of WaterlooCanada

Personalised recommendations