206 citations · 961 across the 151 of their papers we have counts for
5 papers · 1 filter
Vertex-Unfoldings of Simplicial Manifolds
Erik D. Demaine, David Eppstein, Jeff Erickson +2
We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifol…
The Complexity of Clickomania
Therese C. Biedl, Erik D. Demaine, Martin L. Demaine +3
We study a popular puzzle game known variously as Clickomania and Same Game. Basically, a rectangular grid of blocks is initially colored with some number of colors, and the player…
Enumerating Foldings and Unfoldings between Polygons and Polytopes
Erik D. Demaine, Martin L. Demaine, Anna Lubiw +1
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous quest…
Vertex-Unfoldings of Simplicial Polyhedra
Erik D. Demaine, David Eppstein, Jeff Erickson +2
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along…
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Erik D. Demaine, Robert A. Hearn
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview…