Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, and David Eppstein, “Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra”, in Proceedings of the 32nd Canadian Conference in Computational Geometry (CCCG 2020), Saskatchewan, Saskatoon, Canada, August 5–7, 2020.

BibTeX

@InProceedings{VeryUnunfoldable_CCCG2020,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and David Eppstein},
  TITLE         = {Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra},
  BOOKTITLE     = {Proceedings of the 32nd Canadian Conference in Computational Geometry (CCCG 2020)},
  bookurl       = {http://vga.usask.ca/cccg2020/},
  ADDRESS       = {Saskatchewan, Saskatoon, Canada},
  MONTH         = {August 5--7},
  YEAR          = 2020,

  unrefereed    = 1,
  dblp          = {https://dblp.org/rec/conf/cccg/DemaineDE20},
  comments      = {This paper is also available as <A HREF="https://arXiv.org/abs/2007.14525">arXiv:2007.14525</A>. David Eppstein's presentation is available on <A HREF="https://youtu.be/OC4UDsCoIVg">YouTube</A>.},
}

Abstract:

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap. One family of examples is acutely triangulated, i.e., every face is an acute triangle. Another family of examples is stacked, i.e., the result of face-to-face gluings of tetrahedra. Both families achieve another natural property, which we call very ununfoldable: for every k, there is an example such that every nonoverlapping multipiece edge unfolding has at least k pieces.

Comments:

This paper is also available as arXiv:2007.14525. David Eppstein's presentation is available on YouTube.

Availability:

The paper is available in PDF (400k).

See information on file formats.

[Google Scholar search]