Skip to main content

Continuous Flattening of Orthogonal Polyhedra

  • Conference paper
  • First Online:
Discrete and Computational Geometry and Graphs (JCDCGG 2015)

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

Included in the following conference series:

Abstract

Can we flatten the surface of any 3-dimensional polyhedron P without cutting or stretching? Such continuous flat folding motions are known when P is convex, but the question remains open for nonconvex polyhedra. In this paper, we give a continuous flat folding motion when the polyhedron P is an orthogonal polyhedron, i.e., when every face is orthogonal to a coordinate axis (x, y, or z). More generally, we demonstrate a continuous flat folding motion for any polyhedron whose faces are orthogonal to the z axis or the xy plane.

E.D. Demaine and M.L. Demaine—Supported in part by NSF ODISSEI grant EFRI-1240383 and NSF Expedition grant CCF-1138967.

J. Itoh—Supported by Grant-in-Aid for Scientific Research(B)(15KT0020) and Scientific Research(C)(26400072).

C. Nara—Supported by Grant-in-Aid for Scientific Research(C)(16K05258).

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Abel, Z., Demaine, E.D., Demaine, M.L., Itoh, J.-I., Lubiw, A., Nara, C., O’Rourke, J.: Continuously flattening polyhedra using straight skeletons. In: Proceedings of the 30th Annual Symposium on Computational Geometry (SoCG), pp. 396–405 (2014)

    Google Scholar 

  2. Bern, M., Hayes, B.: Origami embedding of piecewise-linear two-manifolds. Algorithmica 59(1), 3–15 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Connelly, R., Sabitov, I., Walz, A.: The bellows conjecture. Beiträge Algebra Geom. 38, 1–10 (1997)

    MathSciNet  MATH  Google Scholar 

  4. Demaine, E.D., Demaine, M.L., Lubiw, A.: Flattening polyhedra (2001). Unpublished manuscript

    Google Scholar 

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

    Book  MATH  Google Scholar 

  6. Itoh, J., Nara, C.: Continuous flattening of platonic polyhedra. In: Akiyama, J., Bo, J., Kano, M., Tan, X. (eds.) CGGA 2010. LNCS, vol. 7033, pp. 108–121. Springer, Heidelberg (2011). doi:10.1007/978-3-642-24983-9_11

    Chapter  Google Scholar 

  7. Itoh, J., Nara, C., Vîlcu, C.: Continuous flattening of convex polyhedra. In: Márquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 85–97. Springer, Heidelberg (2012). doi:10.1007/978-3-642-34191-5_8

    Chapter  Google Scholar 

  8. Nara, C.: Continuous flattening of some pyramids. Elem. Math. 69(2), 45–56 (2014)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chie Nara .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Demaine, E.D., Demaine, M.L., Itoh, Ji., Nara, C. (2016). Continuous Flattening of Orthogonal Polyhedra. In: Akiyama, J., Ito, H., Sakai, T., Uno, Y. (eds) Discrete and Computational Geometry and Graphs. JCDCGG 2015. Lecture Notes in Computer Science(), vol 9943. Springer, Cham. https://doi.org/10.1007/978-3-319-48532-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48532-4_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48531-7

  • Online ISBN: 978-3-319-48532-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics