par Demaine, Erik D. 
;Demaine, Martin L.;Hart, Vi;Iacono, John ;Langerman, Stefan ;O'Rourke, Joseph
Référence Graphs and combinatorics, 27, 3, page (363-376)
Publication Publié, 2011
;Demaine, Martin L.;Hart, Vi;Iacono, John ;Langerman, Stefan ;O'Rourke, Joseph Référence Graphs and combinatorics, 27, 3, page (363-376)
Publication Publié, 2011
Article révisé par les pairs
| Résumé : | 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. © 2011 Springer. |
