321 citations · 2k across the 200 of their papers we have counts for
8 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 Minimum Expectation Selection Problem
David Eppstein, George Lueker
We define the min-min expectation selection problem (resp. max-min expectation selection problem) to be that of selecting k out of n given discrete probability distributions, to mi…
Separating Geometric Thickness from Book Thickness
David Eppstein
We show that geometric thickness and book thickness are not asymptotically equivalent: for every t, there exists a graph with geometric thickness two and book thickness >= t.
Flipping Cubical Meshes
Marshall Bern, David Eppstein, Jeff Erickson
We define and examine flip operations for quadrilateral and hexahedral meshes, similar to the flipping transformations previously used in triangular and tetrahedral mesh generation…
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…
Hinged Kite Mirror Dissection
David Eppstein
Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the…