Name
Abstract | ||
|---|---|---|
We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s00373-011-1024-3 | Graphs and Combinatorics - The Japan Conference on Computational Geometry and Graphs (JCCGG2009) |
Keywords | DocType | Volume |
Unfolding, Folding, Collision-free motion | Journal | 27 |
Issue | ISSN | Citations |
3 | 1435-5914 | 2 |
PageRank | References | Authors |
0.43 | 10 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik D. Demaine | 1 | 4624 | 388.59 |
| Martin L. Demaine | 2 | 592 | 84.37 |
| Vi Hart | 3 | 12 | 1.62 |
| John Iacono | 4 | 404 | 42.83 |
| Stefan Langerman | 5 | 831 | 101.66 |
| Joseph O'Rourke | 6 | 1636 | 439.71 |