Abstract
In this paper, we propose three conclusions for 1 × n maps with square/diagonal grid patterns. First, for a 1 × n map consisting of all the vertical creases and all the diagonal creases as well as a mountain-valley assignment, if it obeys the local flat-foldability, then it can always be globally flat-folded and one of its flat-folded state can be reached in O(n) time. Second, for a 1 × n map consisting of only square/diagonal grid pattern, it also can always be globally flat-folded and one of its flat-foldable state can be reached in O(n) time. We give theoretical proofs for both of them and propose corresponding algorithms. Then, we prove the NP-hardness of the problem of determining the global flat-foldability for a 1 × n map consisting of a square/diagonal grid pattern and a specific mountain-valley assignment. Also, we show that given an order of the faces for an m × n map with all the vertical creases and all the diagonal creases assigned to be mountains or valleys, we can determine its validity in O(mn) time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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 (1996)
Akitaya, H.A., et al.: Box pleating is hard. In: Akiyama, J., Ito, H., Sakai, T. (eds.) JCDCGG 2015. LNCS, vol. 9943, pp. 167–179. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48532-4_15
Demaine, E., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, and Polyhedra. Cambridge University Press, Cambridge (2007)
Arkin, E.M., et al.: When can you fold a map? Comput. Geom. Theor. Appl. 29(1), 23–46 (2004)
Morgan, T.: Map folding. Master’s thesis, Massachusetts Institute of Technology (2012)
Nishat, R.I., Whitesides, S.: Canadian Conference on Computational Geometry, pp. 49–54 (2013)
Justin, J.: Aspects mathematiques du pliage de papier (mathematical aspects of paper fold). In: Huzita, H. (ed.) 1st International Meeting of Origami Science and Scientific Origami, pp. 263–277 (1989)
Hull, T.C.: Counting mountain-valley assignments for flat folds. arXiv preprint arXiv:1410.5022 (2014)
Matsukawa, Y., Yamamoto, Y., Mitani, J.: Enumeration of flat-foldable crease patterns in the square/diagonal grid and their folded shapes. J. Geom. Graph. 21(2), 169–178 (2017)
Kasahara, K., Takahama, T.: Origami for the Connoisseur. Japan Publications Inc. (1978)
Koehler, J.E.: Folding a strip of stamps. J. Combinatorial Theor. 5(2), 135–152 (1968)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Jia, Y., Kanamori, Y., Mitani, J. (2019). Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns. In: Das, G., Mandal, P., Mukhopadhyaya, K., Nakano, Si. (eds) WALCOM: Algorithms and Computation. WALCOM 2019. Lecture Notes in Computer Science(), vol 11355. Springer, Cham. https://doi.org/10.1007/978-3-030-10564-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-10564-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-10563-1
Online ISBN: 978-3-030-10564-8
eBook Packages: Computer ScienceComputer Science (R0)