Continuous Blooming of Convex Polyhedra

Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke

    Research output: Contribution to journalArticlepeer-review


    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.

    Original languageEnglish (US)
    Pages (from-to)363-376
    Number of pages14
    JournalGraphs and Combinatorics
    Issue number3
    StatePublished - May 2011


    • Collision-free motion
    • Folding
    • Unfolding

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Discrete Mathematics and Combinatorics


    Dive into the research topics of 'Continuous Blooming of Convex Polyhedra'. Together they form a unique fingerprint.

    Cite this