|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/16094
|
| タイトル: | Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns |
| 著者: | Ouchi, Koji
Uehara, Ryuhei |
| キーワード: | computational origami
enumeration algorithm
flat foldability
Kawasaki Theorem
Maekawa Theorem |
| 発行日: | 2019-03-01 |
| 出版者: | 電子情報通信学会 |
| 誌名: | IEICE TRANSACTIONS on Information and Systems |
| 巻: | E102-D |
| 号: | 3 |
| 開始ページ: | 416 |
| 終了ページ: | 422 |
| DOI: | 10.1587/transinf.2018FCP0004 |
| 抄録: | We investigate enumeration of distinct flat-foldable crease patterns under the following assumptions: positive integer n is given; every pattern is composed of n lines incident to the center of a sheet of paper; every angle between adjacent lines is equal to 2π/n; every line is assigned one of “mountain,” “valley,” and “flat (or consequently unfolded)”; crease patterns are considered to be equivalent if they are equal up to rotation and reflection. In this natural problem, we can use two well-known theorems for flat-foldability: the Kawasaki Theorem and the Maekawa Theorem in computational origami. Unfortunately, however, they are not enough to characterize all flat-foldable crease patterns. Therefore, so far, we have to enumerate and check flat-foldability one by one using computer. In this study, we develop the first algorithm for the above stated problem by combining these results in a nontrivial way and show its analysis of efficiency. |
| Rights: | Copyright (C)2019 IEICE. Koji Ouchi and Ryuhei Uehara, IEICE TRANSACTIONS on Information and Systems, E102-D(3), 2019, 416-422. http://www.ieice.org/jpn/trans_online/ |
| URI: | http://hdl.handle.net/10119/16094 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 24974.pdf | | 525Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
