Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, and Joseph O'Rourke, “Continuous Blooming of Convex Polyhedra”, in Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), Kanazawa, Ishikawa, Japan, November 11–13, 2009, pages 123–124.

BibTeX

@InProceedings{Blooming_JCCGG2009,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Vi Hart and
                   John Iacono and Stefan Langerman and Joseph O'Rourke},
  TITLE         = {Continuous Blooming of Convex Polyhedra},
  BOOKTITLE     = {Abstracts from the 7th Japan Conference on Computational
                   Geometry and Graphs (JCCGG 2009)},
  bookurl       = {http://www.jaist.ac.jp/~uehara/JCCGG09/},
  ADDRESS       = {Kanazawa, Ishikawa, Japan},
  MONTH         = {November 11--13},
  YEAR          = 2009,
  PAGES         = {123--124},

  unrefereed    = 1,
  papers        = {Blooming_GC},
  length        = {2 pages},
  paperkind     = {abstract},
  comments      = {The full paper is available as
                   <A HREF="http://arxiv.org/abs/0906.2461">
                   arXiv:0906.2461</A>.},
}

Abstract:

We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.

Comments:

The full paper is available as arXiv:0906.2461.

Length:

The abstract is 2 pages.

Availability:

The abstract is available in PostScript (1440k), gzipped PostScript (656k), and PDF (138k).

See information on file formats.

[Google Scholar search]

Related papers:

Blooming_GC (Continuous Blooming of Convex Polyhedra)