Grid vertex-unfolding orthostacks

Erik D. Demaine, John Iacono, Stefan Langerman

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    An algorithm was presented in [BDD + 98] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was 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)
    Title of host publicationDiscrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers
    Pages76-82
    Number of pages7
    Volume3742 LNCS
    DOIs
    StatePublished - 2005
    EventJapanese Conference on Discrete and Computational Geometry, JCDCG 2004 - Tokyo, Japan
    Duration: Oct 8 2004Oct 11 2004

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume3742 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    OtherJapanese Conference on Discrete and Computational Geometry, JCDCG 2004
    CountryJapan
    CityTokyo
    Period10/8/0410/11/04

    Fingerprint

    Unfolding
    Grid
    Vertex of a graph
    Co-ordinate axis
    Overlap
    Arbitrary
    7,7'-dimethoxy-(4,4'-bi-1,3-benzodioxole)-5,5'-dicarboxylic acid dimethyl ester

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    Demaine, E. D., Iacono, J., & Langerman, S. (2005). Grid vertex-unfolding orthostacks. In Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers (Vol. 3742 LNCS, pp. 76-82). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3742 LNCS). https://doi.org/10.1007/11589440_8

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

    Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers. Vol. 3742 LNCS 2005. p. 76-82 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3742 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Demaine, ED, Iacono, J & Langerman, S 2005, Grid vertex-unfolding orthostacks. in Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers. vol. 3742 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3742 LNCS, pp. 76-82, Japanese Conference on Discrete and Computational Geometry, JCDCG 2004, Tokyo, Japan, 10/8/04. https://doi.org/10.1007/11589440_8
    Demaine ED, Iacono J, Langerman S. Grid vertex-unfolding orthostacks. In Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers. Vol. 3742 LNCS. 2005. p. 76-82. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11589440_8
    Demaine, Erik D. ; Iacono, John ; Langerman, Stefan. / Grid vertex-unfolding orthostacks. Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers. Vol. 3742 LNCS 2005. pp. 76-82 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{03b392be307f49cdacedd8d7c45d0fc3,
    title = "Grid vertex-unfolding orthostacks",
    abstract = "An algorithm was presented in [BDD + 98] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was 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.",
    author = "Demaine, {Erik D.} and John Iacono and Stefan Langerman",
    year = "2005",
    doi = "10.1007/11589440_8",
    language = "English (US)",
    isbn = "3540304673",
    volume = "3742 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "76--82",
    booktitle = "Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers",

    }

    TY - GEN

    T1 - Grid vertex-unfolding orthostacks

    AU - Demaine, Erik D.

    AU - Iacono, John

    AU - Langerman, Stefan

    PY - 2005

    Y1 - 2005

    N2 - An algorithm was presented in [BDD + 98] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was 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 - An algorithm was presented in [BDD + 98] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was 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.

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

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

    U2 - 10.1007/11589440_8

    DO - 10.1007/11589440_8

    M3 - Conference contribution

    SN - 3540304673

    SN - 9783540304678

    VL - 3742 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 76

    EP - 82

    BT - Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers

    ER -