13 search results - page 2 / 3 » Immobilizing Hinged Polygons |
COMPGEOM
1995
ACM
15 years 3 months ago
1995
ACM
IJRR
2000
14 years 11 months ago
2000
IJRR
2010
14 years 10 months ago
2010
In this paper, we examine non-stretchable 2D polygonal cloth, and place bounds on the number of fingers needed to immobilize it. For any non-stretchable cloth polygon, it is alwa...
112
click to vote
CORR
1999
Springer
14 years 11 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...
102
click to vote
SIGACT
2008
14 years 11 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...