Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara, “Zipper Unfolding of Domes and Prismoids”, in Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), Waterloo, Ontario, Canada, August 8–10, 2013, to appear.

BibTeX

@InProceedings{ZipperDomes_CCCG2013,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Ryuhei Uehara},
  TITLE         = {Zipper Unfolding of Domes and Prismoids},
  BOOKTITLE     = {Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013)},
  bookurl       = {https://cs.uwaterloo.ca/conferences/cccg2013/},
  ADDRESS       = {Waterloo, Ontario, Canada},
  MONTH         = {August 8--10},
  YEAR          = 2013,
  PAGES         = {to appear},

  unrefereed    = 1,
  length        = {6 pages},
  webpages      = {zippers},
  ee            = {http://cccg.ca/proceedings/2013/papers/paper_10.pdf},
  papers        = {Zippers_CCCG2010},
  dblp          = {https://dblp.org/rec/conf/cccg/DemaineDU13},
}

Abstract:

We study Hamiltonian unfolding—cutting a convex polyhedron along a Hamiltonian path of edges to unfold it without overlap—of two classes of polyhedra. Such unfoldings could be implemented by a single zipper, so they are also known as zipper edge unfoldings. First we consider domes, which are simple convex polyhedra. We find a family of domes whose graphs are Hamiltonian, yet any Hamiltonian unfolding causes overlap, making the domes Hamiltonian-ununfoldable. Second we turn to prismoids, which are another family of simple convex polyhedra. We show that any nested prismoid is Hamiltonian-unfoldable, and that for general prismoids, Hamiltonian unfoldability can be tested in polynomial time.

Length:

The paper is 6 pages.

Availability:

The paper is available in PostScript (3211k), gzipped PostScript (956k), and PDF (979k).

See information on file formats.

[Google Scholar search]

Related papers:

Zippers_CCCG2010 (Zipper Unfoldings of Polyhedral Complexes)

Related webpages:

Zipper Unfolding