Skip to main content
SpringerLink
Log in

Folding and Unfolding in Computational Geometry

  • Conference paper
Discrete and Computational Geometry (JCDCG 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1763))

Included in the following conference series:

Abstract

Three open problems on folding/unfolding are discussed: (1) Can every convex polyhedron be cut along edges and unfolded at to a single nonoverlapping piece? (2) Given gluing instructions for a polygon, construct the unique 3D convex polyhedron to which it folds. (3) Can every planar polygonal chain be straightened?

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

Access this chapter

Log in via an institution
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 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Aronov, B., O’Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM J. Comput. 26, 1689–1713 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alexandrov, A.D.: Konvexe Polyeder. Akademie-Verlag, Berlin (1958)

    Google Scholar 

  3. Aronov, B., O’Rourke, J.: Nonoverlap of the star unfolding. Discrete Comput. Geom. 8, 219–250 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Biedl, T., Demaine, E., Demaine, M., Lubiw, A., O’Rourke, J., Overmars, M., Robbins, S., Streinu, I., Whitesides, S.: On reconfiguring tree linkages: Trees can lock. In: Proc. 10th Canad. Conf. Comput. Geom., p. 45 (1998); Fuller version in Electronic Proc., http://cgm.cs.mcgill.ca/cccg98/proceedings/

  5. Biedl, T., Demaine, E., Demaine, M., Lubiw, A., O’Rourke, J., Overmars, M., Robbins, S., Whitesides, S.: Unfolding some classes of orthogonal polyhedra. In: Proc. 10th Canad. Conf. Comput. Geom., pp. 70–71 (1998); Fuller version in Electronic Proc., http://cgm.cs.mcgill.ca/cccg98/proceedings/

  6. Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O’Rourke, J., Overmars, M., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: Locked and unlocked polygonal chains in 3D. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, January 1999, pp. 866–867 (1999)

    Google Scholar 

  7. Bern, M., Demaine, E., Eppstein, D., Kuo, E.: Ununfoldable polyhedra. In: Proc. 11th Canad. Conf. Comput. Geom., pp. 13–16 (1999); Full version: LANL archive paper number cs. CG/9908003

    Google Scholar 

  8. Biedl, T.C., Demaine, E., Lazard, S., Robbins, S., Soss, M.: Convexifying monotone polygons. Technical Report CS-99-03, Univ. Waterloo, Ontario (1999)

    Google Scholar 

  9. Chen, J., Han, Y.: Shortest paths on a polyhedron. Internat. J. Comput. Geom. Appl. 6, 127–144 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Wang, C.-H.: Manufacturability-driven decomposition of sheet metal products. PhD thesis, Carnegie Mellon University, The Robotics Institute (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Cocan, R., O’Rourke, J.: Polygonal chains cannot lock in 4D. Technical Report 063, Smith College, Northampton, MA (July 1999); Full version of proceedings abstract. LANL archive paper number cs. CG/9908005

    Google Scholar 

  12. Cocan, R., O’Rourke, J.: Polygonal chains cannot lock in 4D. In: Proc. 11th Canad. Conf. Comput. Geom., pp. 5–8 (1999)

    Google Scholar 

  13. Cromwell, P.: Polyhedra. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  14. Cocan, R., O’Rourke, J.: Polygonal chains cannot lock in 4D. Technical Report 063, Smith College, Northampton, MA (July 1999); Full version of proceedings abstract. LANL archive paper number cs. CG/9908005

    Google Scholar 

  15. Demaine, E., Demaine, M., Lubiw, A., O’Rourke, J.: Folding polygons: The decision question (1999) (work in progress)

    Google Scholar 

  16. de Sznagy, B.: Nagy. Solution to problem 3763. Amer. Math. Monthly 46, 176–177 (1939)

    Article  MathSciNet  Google Scholar 

  17. Dürer, A.: The painter’s manual: a manual of measurement of lines, areas, and solids by means of compass and ruler assembled by Albrecht Dürer for the use of all lovers of art with appropriate illustrations arranged to be printed in the year MDXXV. Abaris Books, New York (1977); 1538. Translated and with a commentary by Walter L. Strauss

    Google Scholar 

  18. Everett, H., Lazard, S., Robb, S., Schröder, H., Whitesides, H.: Convexifying star-shaped polygons. In: Proc. 10th Canad. Conf. Comput. Geom., pp. 2–3 (1998)

    Google Scholar 

  19. Erdös, P.: Problem 3763. Amer. Math. Monthly 42, 627 (1935)

    Article  MathSciNet  Google Scholar 

  20. Gupta, S.K., Bourne, D.A., Kim, K.H., Krishnan, S.S.: Automated process planning for sheet metal bending operations. J. Manufacturing Systems 17(5), 338–360 (1998)

    Article  Google Scholar 

  21. Grünbaum, B.: How to convexity a polygon. Gcombinatorics 5, 24–30 (1995)

    Google Scholar 

  22. Lubiw, A., O’Rourke, J.: When can a polygon fold to a polytope? Technical Report 048, Dept. Comput. Sci., Smith College (June 1996); Presented at AMS Conf. (October 5, 1996)

    Google Scholar 

  23. Lenhart, W.J., Whitesides, S.H.: Reconfiguring closed polygonal chains in Euclidean d-space. Discrete Comput. Geom. 13, 123–140 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  24. Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput. 16, 647–668 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  25. Namiki, M., Fukuda, K.: Unfolding 3-dimensional convex polytopes: A package for Mathematica 1.2 or 2.0. Mathematica Notebook, Univ. of Tokyo (1993)

    Google Scholar 

  26. Schevon, C.: Algorithms for geodesies on polytopes. PhD thesis, Johns Hopkins University (1989)

    Google Scholar 

  27. Shephard, G.C.: Convex polytopes with convex nets. Math. Proc. Camb. Phil. Soc. 78, 389–403 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  28. Schevon, C., O’Rourke, J.: A conjecture on random unfoldings. Technical Report JHU-87/20, Johns Hopkins Univ., Baltimore, MD (July 1987)

    Google Scholar 

  29. Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM J. Comput. 15, 193–215 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  30. Toussaint, G.T.: The Erdös-Nagy theorem and its ramifications. In: Proc. 11th Canad. Conf. Comput. Geom., pp. 9–12 (1999); Fuller version in Electronic Proc. http://www.cs.ubc.ca/conferences/CCCG/elecproc.html

  31. Wang, C.-H.: Manufacturability-driven decomposition of sheet metal products. PhD thesis, Carnegie Mellon University, The Robotics Institute (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Smith College, Northampton, MA, 01063, USA

    Joseph O’Rourke

Authors
  1. Joseph O’Rourke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute of Education, Tokai University, 2-28-4 Tomigaya, Shibuya-ku Tokio, Japan

    Jin Akiyama

  2. Ibaraki University, Nakanarusawa, 316-8511, Hitachi Ibaraki, Japan

    Mikio Kano

  3. Department of Mathematics, Tokai University, 3-20-1 Orido, Shimizu, Shizuoka, 424-8610, Japan

    Masatsugu Urabe

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

O’Rourke, J. (2000). Folding and Unfolding in Computational Geometry. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46515-7_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67181-7

  • Online ISBN: 978-3-540-46515-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation