Advertisement

Efficient Algorithm for Box Folding

  • Koichi Mizunashi
  • Takashi Horiyama
  • Ryuhei UeharaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11355)

Abstract

For a given polygon P and a polyhedron Q, the folding problem asks if Q can be obtained from P by folding it. This simple problem is quite complicated, and there is no known efficient algorithm that solves this problem in general. In this paper, we focus on the case that Q is a box, and the size of Q is not given. That is, input of the box folding problem is a polygon P, and it asks if P can fold to boxes of certain sizes. We note that there exist an infinite number of polygons P that can fold into three boxes of different sizes. In this paper, we give a pseudo polynomial time algorithm that computes all possible ways of folding of P to boxes.

Keywords

Computational Origami Computational geometry Box folding 

Notes

Acknowledgements

A part of this research is supported by JSPS KAKENHI Grant Number JP17H06287 and 18H04091.

References

  1. 1.
    Abel, Z.R., Demaine, E.D., Demaine, M.L., Ito, H., Snoeyink, J., Uehara, R.: Bumpy Pyramid Folding. Computational Geometry: Theory and Applications (2018, accepted).  https://doi.org/10.1016/j.comgeo.2018.06.007
  2. 2.
    Akiyama, J.: Tile-Makers and Semi-Tile-Makers. The Mathematical Association of Amerika, Monthly 114, pp. 602–609, August–September 2007Google Scholar
  3. 3.
    Akiyama, J., Nara, C.: Developments of polyhedra using oblique coordinates. J. Indonesia. Math. Soc. 13(1), 99–114 (2007)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bobenko, A.I., Izmestiev, I.: Alexandrov’s theorem, weighted Delaunay triangulations, and mixed volumes. Annales de l’Institut Fourier 58(2), 447–505 (2008)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Buchin, K., et al.: On rolling cube puzzles. In: 19th Canadian Conference on Computational Geometry (CCCG 2007), pp. 141–144 (2007)Google Scholar
  6. 6.
    Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, New York (2007)CrossRefGoogle Scholar
  7. 7.
    Dürer, A.: Underweysung der messung, mit den zirckel un richtscheyt, in Linien ebnen unnd gantzen corporen (1525)Google Scholar
  8. 8.
    Horiyama, T., Mizunashi, K.: Folding orthogonal polygons into rectangular boxes. In: Proceedings of the 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2016) (2016)Google Scholar
  9. 9.
    Kane, D., Price, G.N., Demaine, E.D.: A pseudopolynomial algorithm for Alexandrov’s theorem. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 435–446. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-03367-4_38CrossRefGoogle Scholar
  10. 10.
    Mitani, J., Uehara, R.: Polygons folding to plural incongruent orthogonal boxes. In: Canadian Conference on Computational Geometry (CCCG 2008), pp. 39–42 (2008)Google Scholar
  11. 11.
    Shirakawa, T., Uehara, R.: Common developments of three incongruent orthogonal boxes. Int. J. Comput. Geom. Appl. 23(1), 65–71 (2013)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Xu, D., Horiyama, T., Shirakawa, T., Uehara, R.: Common developments of three incongruent boxes of area 30. Comput. Geom. Theory Appl. 64, 1–17 (2017)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Koichi Mizunashi
    • 1
  • Takashi Horiyama
    • 1
  • Ryuhei Uehara
    • 2
    Email author
  1. 1.Graduate School of Science and EngineeringSaitama UniversitySakuraJapan
  2. 2.School of Information ScienceJapan Advanced Institute of Science and Technology (JAIST)NomiJapan

Personalised recommendations