CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine† - Polyhedra - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine† Add to Reading List Document Date: 2017-07-06 00:58:59 Open Document File Size: 293,88 KB Share Result on Facebook City Montr´eal / Bern / / Company Cambridge University Press / square D / / Country United States / Canada / / / Facility wM square / Massachusetts Institute of Technology / Tower Think / / IndustryTerm manufacturing applications / / MusicGroup U2 / / Organization Cambridge University / Department of Mathematics / Massachusetts Institute of Technology / Computer Science and Artificial Intelligence Lab / National Science Foundation / / ProvinceOrState Massachusetts / / Technology Geometric Folding Algorithms / / SocialTag Cuboctahedron Wire Convex geometry Euclidean geometry Deltahedra Polyhedron Geometry Unfolding

CCCG 2011, Toronto ON, August 10–12, 2011 Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel∗ Erik D. Demaine†Add to Reading List