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”, Graphs and Combinatorics, volume 27, number 3, 2011, pages 363–376.

BibTeX

@Article{Blooming_GC,
  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},
  JOURNAL       = {Graphs and Combinatorics},
  journalurl    = {http://www.springer.com/mathematics/numbers/journal/373},
  VOLUME        = 27,
  NUMBER        = 3,
  YEAR          = 2011,
  PAGES         = {363--376},

  replaces      = {Blooming_JCCGG2009},
  papers        = {Blooming_JCCGG2009},
  length        = {13 pages},
  doi           = {https://dx.doi.org/10.1007/s00373-011-1024-3},
  dblp          = {https://dblp.org/rec/journals/gc/DemaineDHILO11},
  comments      = {The paper is also available as
                   <A HREF="http://arxiv.org/abs/0906.2461">
                   arXiv:0906.2461</A> and from
                   <A HREF="http://dx.doi.org/10.1007/s00373-011-1024-3">SpringerLink</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 paper is also available as arXiv:0906.2461 and from SpringerLink.

Length:

The paper is 13 pages.

Availability:

The paper is available in PostScript (3346k), gzipped PostScript (1539k), and PDF (270k).

See information on file formats.

[Google Scholar search]

Related papers:

Blooming_JCCGG2009 (Continuous Blooming of Convex Polyhedra)