Paper by Erik D. Demaine

Reference:

Zachary Abel and Erik D. Demaine, “Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete”, in Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Ontario, Canada, August 10–12, 2011, to appear.

BibTeX

@InProceedings{UnfoldingComplexity_CCCG2011,
  AUTHOR        = {Zachary Abel and Erik D. Demaine},
  TITLE         = {Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete},
  BOOKTITLE     = {Proceedings of the 23rd Canadian Conference on
                   Computational Geometry (CCCG 2011)},
  bookurl       = {http://2011.cccg.ca/},
  ADDRESS       = {Toronto, Ontario, Canada},
  MONTH         = {August 10--12},
  YEAR          = 2011,
  PAGES         = {to appear},

  length        = {6 pages},
  withstudent   = 1,
  unrefereed    = 1,
  dblp          = {https://dblp.org/rec/conf/cccg/AbelD11},
  ee            = {http://www.cccg.ca/proceedings/2011/papers/paper43.pdf},
}

Abstract:

We prove that it is strongly NP-complete to decide whether a given orthogonal polyhedron has a (nonoverlapping) edge unfolding. The result holds even when the polyhedron is topologically convex, i.e., is homeomorphic to a sphere, has faces that are homeomorphic to disks, and where every two faces share at most one edge.

Length:

The paper is 6 pages.

Availability:

The paper is available in PDF (293k).

See information on file formats.

[Google Scholar search]