Abstract
We investigate enumeration of distinct flat-foldable crease patterns with natural assumptions. Precisely, for a given positive integer n, potential set of n crease lines are incident to the center of a sheet of disk paper at regular angles. That is, every angle between adjacent lines is equal to \(2\pi /n\). Then each line is assigned one of “mountain,” “valley,” and “flat (or consequently unfolded).” That is, we enumerate all flat-foldable crease patterns with up to n crease lines of unit angle \(2\pi /n\). We note that two crease patterns are equivalent if they are equal up to rotation and reflection. In computational origami, there are two well-known theorems for flat-foldability: the Kawasaki Theorem and the Maekawa Theorem. The first one is a necessary and sufficient condition of crease layout, however, it does not give us valid mountain/valley assignments. The second one is a necessary condition between the number of “mountain” and that of “valley.” However, sufficient condition(s) is(are) not known. Therefore, we have to enumerate and check flat-foldability one by one using other algorithm. In this research, we develop the first algorithm for the above stated problem by combining these results in a nontrivial way, and show its analysis of efficiency. We also give experimental results, which give us a new series of integer sequence.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1), 21–46 (1996)
Bern, M., Hayes, B.: The complexity of flat origami. In: SODA, vol. 96, pp. 175–183 (1996)
Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4–5), 240–242 (1980)
De La Briandais, R.: File searching using variable length keys. In: Papers Presented at the Western Joint Computer Conference, 3–5 March 1959, pp. 295–298. ACM (1959)
Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)
Fredkin, E.: Trie memory. Commun. ACM 3(9), 490–499 (1960)
Hoskins, W., Street, A.P.: Twills on a given number of harnesses. J. Aust. Math. Soc. (Ser. A) 33(01), 1–15 (1982)
Hull, T.: Counting mountain-valley assignments for flat folds. Ars Comb. 67, 175–187 (2003)
Sawada, J.: Generating bracelets in constant amortized time. SIAM J. Comput. 31(1), 259–268 (2001)
Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 16–31. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30214-8_2
Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 71–80. ACM (2002)
Acknowledgement
We would like to thank Yota Otachi for his fruitful discussions and comments. This work is partially supported by MEXT/JSPS Kakenhi Grant Number 26330009 and 24106004.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ouchi, K., Uehara, R. (2017). Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. In: Poon, SH., Rahman, M., Yen, HC. (eds) WALCOM: Algorithms and Computation. WALCOM 2017. Lecture Notes in Computer Science(), vol 10167. Springer, Cham. https://doi.org/10.1007/978-3-319-53925-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-53925-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53924-9
Online ISBN: 978-3-319-53925-6
eBook Packages: Computer ScienceComputer Science (R0)