52 citations · 271 across the 48 of their papers we have counts for
55 papers
Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard
Zachary Abel, Erik D. Demaine, Martin L. Demaine +3
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid cro…
Continuous Flattening and Reversing of Convex Polyhedral Linkages
Erik D. Demaine, Martin L. Demaine, Markus Hecher +3
We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flatte…
Folding One Polyhedral Metric Graph into Another
Lily Chung, Erik D. Demaine, Martin L. Demaine +4
We analyze the problem of folding one polyhedron, viewed as a metric graph of its edges, into the shape of another, similar to 1D origami. We find such foldings between all pairs o…
Every Author as First Author
Erik D. Demaine, Martin L. Demaine
We propose a new standard for writing author names on papers and in bibliographies, which places every author as a first author -- superimposed. This approach enables authors to wr…
Orthogonal Fold & Cut
Hayashi Ani, Josh Brunner, Erik D. Demaine +4
We characterize the cut patterns that can be produced by "orthogonal fold & cut": folding an axis-aligned rectangular sheet of paper along horizontal and vertical creases, and then…
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
Erik D. Demaine, Martin L. Demaine, Jenny Diomidova +3
We show that several classes of polyhedra are joined by a sequence of O(1) refolding steps, where each refolding step unfolds the current polyhedron (allowing cuts anywhere on the…