JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/15105

Title: Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
Authors: Ouchi, Koji
Uehara, Ryuhei
Keywords: computational origami
mountain fold and valley fold
balanced twill
Issue Date: 2017-02-21
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 10167
Start page: 19
End page: 29
DOI: 10.1007/978-3-319-53925-6_2
Abstract: We investigate the following computational origami problem; the input is a positive integer n. We then draw n lines in a radial pattern. They are incident to the central point of a sheet of paper, and every angle between two consecutive lines is equal to 2π/n. Each line is assigned one of “mountain,” “valley,” and “flat” (or consequently unfolded), and only flat-foldable patterns will be output. We consider two crease patterns are the same if they can be equal with rotations and reflections. We propose an efficient enumeration algorithm for flat-foldable single vertex crease patterns for given n. In computational origami, there are well-known theorems for flat-foldability; Kawasaki Theorem and Maekawa Theorem. However, they give us necessary conditions, and sufficient condition is not known. Therefore, we have to enumerate and check flat-foldability one by one using the other algorithm. In this paper, we develop the first algorithm for the above stated problem by combining these results in nontrivial way, and show its analysis of efficiency.
Rights: This is the author-created version of Springer, Koji Ouchi and Ryuhei Uehara, Lecture Notes in Computer Science, 10167, 2017, 19-29. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-53925-6_2
URI: http://hdl.handle.net/10119/15105
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
23597.pdf966KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology