Martin Demaine

On Reconfiguring Tree Linkages: Trees can Lock (2000)

Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, ...

It is an open problem to determine whether a polygonal chain can be "straightened" in the plane if its links are not allowed to cross. In this paper we propose a related question: whether a...

Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes (2000)

Erik Demaine, Martin Demaine, Anna Lubiw, Joseph O'Rourke

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it...

On Reconfiguring Tree Linkages: Trees can Lock (1999)

Biedl, Therese, Demaine, Erik, Demaine, Martin, Lazard, Sylvain, Lubiw, Anna, O'Rourke, Joseph, ...

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 reconfigured to be convex....

Metamorphosis of the Cube (1999)

Erik Demaine, Martin Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko

Introduction The foldings and unfoldings shown in this video illustrate two problems: (1) cut open and unfold a convex polyhedron to a simple planar polygon; and (2) fold and glue a simple planar...

Metamorphosis of the cube (1999)

Erik Demaine, Martin Demaine, Anna Lubiw

The foldings and unfoldings shown in this video illustrate two problems: (1) cut open and unfold a convex polyhedron to a simple planar polygon; and (2) fold and glue a simple planar polygon into a...

Unfolding Some Classes of Orthogonal Polyhedra (1998)

Therese Biedl, Erik Demaine, Martin Demaine, Anna Lubiw, Mark Overmars, Joseph O'Rourke, ...

In this paper, we study unfoldings of orthogonal polyhedra. More precisely, we define two special classes of orthogonal polyhedra, orthostacks and orthotubes, and show how to generate unfoldings by...

On Reconfiguring Tree Linkages: Trees can Lock (1998)

Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Steve Robbins, ...

It is an open problem to determine whether a polygonal chain can be "straightened" in the plane if its links are not allowed to cross. This problem been raised independently by several...