Grid vertex-unfolding orthostacks

Erik D. Demaine, John Iacono, Stefan Langerman

    Research output: Contribution to journalArticle

    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

    Fingerprint

    Unfolding
    Grid
    Vertex of a graph
    Co-ordinate axis
    Overlap
    Arbitrary

    Keywords

    • cutting
    • Edge unfolding
    • folding
    • orthogonal polyhedra

    ASJC Scopus subject areas

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

    Cite this

    Grid vertex-unfolding orthostacks. / Demaine, Erik D.; Iacono, John; Langerman, Stefan.

    In: International Journal of Computational Geometry and Applications, Vol. 20, No. 3, 06.2010, p. 245-254.

    Research output: Contribution to journalArticle

    Demaine, Erik D. ; Iacono, John ; Langerman, Stefan. / Grid vertex-unfolding orthostacks. In: International Journal of Computational Geometry and Applications. 2010 ; Vol. 20, No. 3. pp. 245-254.
    @article{6f0e4db85b2d4743bc2a152d757d6ec0,
    title = "Grid vertex-unfolding orthostacks",
    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.",
    keywords = "cutting, Edge unfolding, folding, orthogonal polyhedra",
    author = "Demaine, {Erik D.} and John Iacono and Stefan Langerman",
    year = "2010",
    month = "6",
    doi = "10.1142/S0218195910003281",
    language = "English (US)",
    volume = "20",
    pages = "245--254",
    journal = "International Journal of Computational Geometry and Applications",
    issn = "0218-1959",
    publisher = "World Scientific Publishing Co. Pte Ltd",
    number = "3",

    }

    TY - JOUR

    T1 - Grid vertex-unfolding orthostacks

    AU - Demaine, Erik D.

    AU - Iacono, John

    AU - Langerman, Stefan

    PY - 2010/6

    Y1 - 2010/6

    N2 - 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.

    AB - 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.

    KW - cutting

    KW - Edge unfolding

    KW - folding

    KW - orthogonal polyhedra

    UR - http://www.scopus.com/inward/record.url?scp=77954325911&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77954325911&partnerID=8YFLogxK

    U2 - 10.1142/S0218195910003281

    DO - 10.1142/S0218195910003281

    M3 - Article

    AN - SCOPUS:77954325911

    VL - 20

    SP - 245

    EP - 254

    JO - International Journal of Computational Geometry and Applications

    JF - International Journal of Computational Geometry and Applications

    SN - 0218-1959

    IS - 3

    ER -