72 citations · 218 across the 15 of their papers we have counts for
6 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.
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…
Optimization Over Zonotopes and Training Support Vector Machines
Marshall Bern, David Eppstein
We make a connection between classical polytopes called zonotopes and Support Vector Machine (SVM) classifiers. We combine this connection with the ellipsoid method to give some ne…
Optimal Moebius Transformations for Information Visualization and Meshing
Marshall Bern, David Eppstein
We give linear-time quasiconvex programming algorithms for finding a Moebius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the…