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
    DOIs
    StatePublished - Dec 1 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)0302-9743
    ISSN (Electronic)1611-3349

    Other

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

      Fingerprint

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    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 (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