Paper by Erik D. Demaine

Reference:

Erik D. Demaine, John Iacono, and Stefan Langerman, “Grid Vertex-Unfolding Orthostacks”, in Revised Selected Papers from the Japan Conference on Discrete and Computational Geometry (JCDCG 2004), Lecture Notes in Computer Science, volume 3742, Tokyo, Japan, October 8–11, 2004, pages 76–82.

BibTeX

@InProceedings{Orthoballs_JCDCG2004,
  AUTHOR        = {Erik D. Demaine and John Iacono and Stefan Langerman},
  TITLE         = {Grid Vertex-Unfolding Orthostacks},
  BOOKTITLE     = {Revised Selected Papers from the Japan Conference on
                   Discrete and Computational Geometry (JCDCG 2004)},
  bookurl       = {http://www.ried.tokai.ac.jp/JCDCG/},
  SERIES        = {Lecture Notes in Computer Science},
  SERIESURL     = {http://www.springer.de/comp/lncs/},
  VOLUME        = 3742,
  ADDRESS       = {Tokyo, Japan},
  MONTH         = {October 8--11},
  YEAR          = 2004,
  PAGES         = {76--82},

  COPYRIGHT     = {Copyright held by the authors.},
  papers        = {Orthoballs_IJCGA},
  doi           = {https://dx.doi.org/10.1007/11589440_8},
  dblp          = {https://dblp.org/rec/conf/jcdcg/DemaineIL04},
  COMMENTS      = {This paper is also available from <A HREF="https://doi.org/10.1007/11589440_8">SpringerLink</A>.},
  length        = {7 pages},
}

Abstract:

An algorithm was presented in [1] 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.

Comments:

This paper is also available from SpringerLink.

Copyright:

Length:

The paper is 7 pages.

Availability:

The paper is available in PostScript (263k), gzipped PostScript (111k), and PDF (133k).

See information on file formats.

[Google Scholar search]

Related papers:

Orthoballs_IJCGA (Grid Vertex-Unfolding Orthostacks)