|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/16199
|
| タイトル: | Efficient Algorithm for Box Folding |
| 著者: | Mizunashi, Koichi
Horiyama, Takashi
Uehara, Ryuhei |
| キーワード: | Computational Origami
Computational Geometry
Box-folding |
| 発行日: | 2018-12-21 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 11355 |
| 開始ページ: | 277 |
| 終了ページ: | 288 |
| DOI: | 10.1007/978-3-030-10564-8_22 |
| 抄録: | For a given polygon P and a polyhedron Q, the folding problem asks if Q can be obtained from P by folding it. This simple problem is quite complicated, and there is no known efficient algorithm that solves this problem in general. In this paper, we focus on the case that Q is a box, and the size of Q is not given. That is, input of the box folding problem is a polygon P, and it asks if P can fold to boxes of certain sizes. We note that there exist an infinite number of polygons P that can fold into three boxes of different sizes. In this paper, we give a pseudo polynomial time algorithm that computes all possible ways of folding of P to boxes. |
| Rights: | This is the author-created version of Springer, Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara, Lecture Notes in Computer Science, 11355, 2018, 277-288. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-030-10564-8_22 |
| URI: | http://hdl.handle.net/10119/16199 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 25054.pdf | | 286Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
