26 citations · 54 across the 9 of their papers we have counts for
5 papers · 1 filter
Locked and Unlocked Polygonal Chains in 3D
T. Biedl, E. Demaine, M. Demaine +8
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a stra…
On Reconfiguring Tree Linkages: Trees can Lock
Therese Biedl, Erik Demaine, Martin Demaine +7
It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfig…
Computational Geometry Column 37
Erik D. Demaine, Joseph O'Rourke
Open problems from the 15th Annual ACM Symposium on Computational Geometry.
Ununfoldable Polyhedra with Convex Faces
Marshall Bern, Erik D. Demaine, David Eppstein +3
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the s…
Hinged Dissection of Polyominoes and Polyforms
Erik D. Demaine, Martin L. Demaine, David Eppstein +2
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection o…