JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/15105
|
タイトル: | Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns |
著者: | Ouchi, Koji Uehara, Ryuhei |
キーワード: | computational origami mountain fold and valley fold enumeration balanced twill |
発行日: | 2017-02-21 |
出版者: | Springer |
誌名: | Lecture Notes in Computer Science |
巻: | 10167 |
開始ページ: | 19 |
終了ページ: | 29 |
DOI: | 10.1007/978-3-319-53925-6_2 |
抄録: | 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 |
資料タイプ: | author |
出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
ファイル |
記述 |
サイズ | 形式 |
23597.pdf | | 966Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|