4 search results - page 1 / 1 » Hinged Dissection of Polygons is Hard |
CCCG
2003
14 years 11 months ago
2003
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...
103
click to vote
CORR
1999
Springer
14 years 9 months ago
1999
Springer
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...
SIGACT
2008
14 years 9 months ago
2008
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...
103
click to vote
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
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...