We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
Robert A. Hearn, Erik D. Demaine, Greg N. Frederic...
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be rotated into any member of S. We present a hinged dissection...
Erik D. Demaine, Martin L. Demaine, David Eppstein...
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...