Grid vertex-unfolding orthostacks

Erik D. Demaine; John Iacono; Stefan Langerman

doi:10.1007/11589440_8

Grid vertex-unfolding orthostacks

Erik D. Demaine, John Iacono, Stefan Langerman

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers
Pages	76-82
Number of pages	7
DOIs	https://doi.org/10.1007/11589440_8
State	Published - 2005
Event	Japanese Conference on Discrete and Computational Geometry, JCDCG 2004 - Tokyo, Japan Duration: Oct 8 2004 → Oct 11 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3742 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	Japanese Conference on Discrete and Computational Geometry, JCDCG 2004
Country/Territory	Japan
City	Tokyo
Period	10/8/04 → 10/11/04

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11589440_8

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

Grid vertex-unfolding orthostacks. / Demaine, Erik D.; Iacono, John; Langerman, Stefan.
Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers. 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 proceeding › Conference contribution

Demaine, ED, Iacono, J & Langerman, S 2005, Grid vertex-unfolding orthostacks. in Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers. 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

@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",

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

AN - SCOPUS:33646509031

SN - 3540304673

SN - 9783540304678

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

T2 - Japanese Conference on Discrete and Computational Geometry, JCDCG 2004

Y2 - 8 October 2004 through 11 October 2004

ER -

Grid vertex-unfolding orthostacks

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this