|
|
|
|
| LEADER |
01775 am a22002413u 4500 |
| 001 |
100407 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Demaine, Erik D.
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Demaine, Erik D.
|e contributor
|
| 100 |
1 |
0 |
|a Demaine, Martin L.
|e contributor
|
| 700 |
1 |
0 |
|a Demaine, Martin L.
|e author
|
| 700 |
1 |
0 |
|a Uehara, Ryuhei
|e author
|
| 245 |
0 |
0 |
|a Zipper unfolding of domes and prismoids
|
| 260 |
|
|
|c 2015-12-17T12:17:46Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/100407
|
| 520 |
|
|
|a We study Hamiltonian unfolding-cutting a convex polyhedron along a Hamiltonian path of edges to unfold it without overlap-of two classes of polyhedra. Such unfoldings could be implemented by a single zipper, so they are also known as zipper edge unfoldings. First we consider domes, which are simple convex polyhedra. We find a family of domes whose graphs are Hamiltonian, yet any Hamiltonian unfolding causes overlap, making the domes Hamiltonian-ununfoldable. Second we turn to prismoids, which are another family of simple convex polyhedra. We show that any nested prismoid is Hamiltonian-unfoldable, and that for general prismoids, Hamiltonian unfoldability can be tested in polynomial time.
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Origami Design for Integration of Self-assembling Systems for Engineering Innovation Grant EFRI-1240383)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Expedition Grant CCF-1138967)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Proceedings of the 25th Canadian Conference on Computational Geometry
|
