|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b11. 会議発表論文・発表資料等 >
b11-1. 会議発表論文・発表資料 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/14769
|
| タイトル: | Bumpy Pyramid Folding |
| 著者: | Abel, Zachary R.
Demaine, Erik D.
Demaine, Martin L.
Ito, Hiro
Snoeyink, Jack
Uehara, Ryuhei |
| キーワード: | folding problem
pyramid
petal polygon
Alexandrov's theorem |
| 発行日: | 2014-08 |
| 出版者: | CCCG 2014 |
| 誌名: | The 26th Canadian Conference on Computational Geometry (CCCG 2014) |
| 開始ページ: | 258 |
| 終了ページ: | 266 |
| 抄録: | We investigate folding problems for a class of petal polygons P, which have an n-polygonal base B surrounded by a sequence of triangles. We give linear time algorithms using constant precision to determine if P can fold to a pyramid with flat base B, and to determine a triangulation of B (crease pattern) that allows folding into a convex (triangulated) polyhedron. By Alexandrov's theorem, the crease pattern is unique if it exists, but the general algorithm known for this theorem is pseudo-polynomial, with very large running time; ours is the first efficient algorithm for Alexandrov's theorem for a special class of polyhedra. We also give a polynomial time algorithm that finds the crease pattern to produce the maximum volume triangulated polyhedron. |
| Rights: | Copyright (C) 2014 Authors. Zachary R. Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink and Ryuhei Uehara, The 26th Canadian Conference on Computational Geometry (CCCG 2014), 2014, 258-266. |
| URI: | http://hdl.handle.net/10119/14769 |
| 資料タイプ: | publisher |
| 出現コレクション: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 20453.pdf | | 177Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
