Paper by Erik D. Demaine

Reference:

Erik D. Demaine, John Iacono, and Stefan Langerman, “Grid Vertex-Unfolding Orthostacks”, International Journal of Computational Geometry and Applications, volume 20, number 3, 2010, pages 245–254.

BibTeX

@Article{Orthoballs_IJCGA,
  AUTHOR        = {Erik D. Demaine and John Iacono and Stefan Langerman},
  TITLE         = {Grid Vertex-Unfolding Orthostacks},
  JOURNAL       = {International Journal of Computational Geometry and
                   Applications},
  journalurl    = {http://www.worldscinet.com/ijcga/ijcga.shtml},
  VOLUME        = 20,
  NUMBER        = 3,
  YEAR          = 2010,
  PAGES         = {245--254},

  doi           = {https://dx.doi.org/10.1142/S0218195910003281},
  dblp          = {https://dblp.org/rec/journals/ijcga/DemaineIL10},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1142/S0218195910003281">WorldSciNet</A>.},
  length        = {10 pages},
  papers        = {Orthoballs_JCDCG2004},
  replaces      = {Orthoballs_JCDCG2004},
}

Abstract:

Biedl et al. ¹ 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.

Comments:

This paper is also available from WorldSciNet.

Length:

The paper is 10 pages.

Availability:

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

See information on file formats.

[Google Scholar search]

Related papers:

Orthoballs_JCDCG2004 (Grid Vertex-Unfolding Orthostacks)