Abstract
Flat foldability of general crease patterns was first claimed to be hard for over twenty years. In this paper we prove that deciding flat foldability remains NP-complete even for box pleating, where creases form a subset of a square grid with diagonals. In addition, we provide new terminology to implicitly represent the global layer order of a flat folding, and present a new planar reduction framework for grid-aligned gadgets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
This problem is sometimes called ‘positive’ as variables cannot appear negated within clauses, however we follow the naming convention from [Sch78].
References
Arkin, E.M., Bender, M.A., Demaine, E.D., Demaine, M.L., Mitchell, J.S.B., Sethia, S., Skiena, S.S.: When can you fold a map? Comput. Geom. Theory Appl. 29(1), 23–46 (2004)
Benbernou, N.M., Demaine, E.D., Demaine, M.L., Ovadya, A.: Universal hinge patterns to fold orthogonal shapes. In: Origami\(^5\), pp. 405–420. A.K Peters, Singapore, July 2010
Bern, M., Hayes, B.: The complexity of flat origami. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1996, pp. 175–183. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1996)
Demaine, E.D., Fekete, S.P., Lang, R.J.: Circle packing for origami design is hard. In: Origami\(^5\), pp. 609–626. A.K Peters, Singapore (2010)
Demaine, E.D., O’Rourke, J., Algorithms, G.F.: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)
Robertson, S.A.: Isometric folding of Riemannian manifolds. Proc. Roy. Soc. Edinburgh 79(3–4), 275–284 (1977)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 216–226. ACM (1978)
Acknowledgements
This work was begun at the 2015 Bellairs Workshop on Computational Geometry, co-organized by Erik Demaine and Godfried Toussaint. We thank the other participants of the workshop for stimulating discussions, and to Barry Hayes for helpful comments leading to some simplifications. The research of H. Akitaya was supported by NSF grant CCF-1422311 and Science without Borders. The research of T. Hull and T. Tachi were respectively supported by NSF grant EFRI-ODISSEI-1240441 and the JST Presto Program.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Akitaya, H.A. et al. (2016). Box Pleating is Hard. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-48532-4_15
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)