9 citations · 14 across the 7 of their papers we have counts for
7 papers
Minimum feature size preserving decompositions
Greg Aloupis, Erik D. Demaine, Martin L. Demaine +2
The minimum feature size of a crossing-free straight line drawing is the minimum distance between a vertex and a non-incident edge. This quantity measures the resolution needed to…
Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves
Greg Aloupis, Sebastien Collette, Erik D. Demaine +3
We consider the theoretical model of Crystalline robots, which have been introduced and prototyped by the robotics community. These robots consist of independently manipulable unit…
(Non)existence of Pleated Folds: How Paper Folds Between Creases
Erik D. Demaine, Martin L. Demaine, Vi Hart +2
We prove that the pleated hyperbolic paraboloid, a familiar origami model known since 1927, in fact cannot be folded with the standard crease pattern in the standard mathematical m…
Continuous Blooming of Convex Polyhedra
Erik D. Demaine, Martin L. Demaine, Vi Hart +3
We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can b…
The Price of Anarchy in Cooperative Network Creation Games
Erik D. Demaine, Mohammadtaghi Hajiaghayi, Hamid Mahini +1
In general, the games are played on a host graph, where each node is a selfish independent agent (player) and each edge has a fixed link creation cost α. Together the agents create…
A Generalized Carpenter's Rule Theorem for Self-Touching Linkages
Timothy G. Abbott, Erik D. Demaine, Blaise Gassend
The Carpenter's Rule Theorem states that any chain linkage in the plane can be folded continuously between any two configurations while preserving the bar lengths and without the b…