Grid vertex-unfolding orthostacks

Erik D. Demaine, John Iacono, Stefan Langerman

    Research output: Contribution to journalArticlepeer-review

    Abstract

    Biedl et al.1 presented an algorithm for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. They conjectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex unfolding using only such cuts.

    Original languageEnglish (US)
    Pages (from-to)245-254
    Number of pages10
    JournalInternational Journal of Computational Geometry and Applications
    Volume20
    Issue number3
    DOIs
    StatePublished - Jun 2010

    Keywords

    • Edge unfolding
    • cutting
    • folding
    • orthogonal polyhedra

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Geometry and Topology
    • Computational Theory and Mathematics
    • Computational Mathematics
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'Grid vertex-unfolding orthostacks'. Together they form a unique fingerprint.

    Cite this