321 citations · 2k across the 200 of their papers we have counts for
6 papers · 2 filters
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…
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…
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…