Sciweavers

5 search results - page 1 / 1
» Hinged Dissection of Polypolyhedra
Sort
View
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
13 years 10 months ago
Hinged Dissection of Polypolyhedra
This paper presents a general family of 3D hinged dissections for polypolyhedra, i.e., connected 3D solids formed by joining several rigid copies of the same polyhedron along iden...
Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lin...
CCCG
2003
13 years 6 months ago
Hinged Dissection of Polygons is Hard
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...
CORR
1999
Springer
105views Education» more  CORR 1999»
13 years 4 months ago
Hinged Dissection of Polyominoes and Polyforms
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...
COMPGEOM
2008
ACM
13 years 6 months ago
Hinged dissections exist
Timothy G. Abbott, Zachary Abel, David Charlton, E...
SIGACT
2008
103views more  SIGACT 2008»
13 years 4 months ago
Computational geometry column 50
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...
Joseph O'Rourke