56 citations · 204 across the 25 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…
Dense point sets have sparse Delaunay triangulations
Jeff Erickson
The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with s…
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…
Arbitrarily Large Neighborly Families of Congruent Symmetric Convex 3-Polytopes
Jeff Erickson
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family co…
Nice point sets can have nasty Delaunay triangulations
Jeff Erickson
We consider the complexity of Delaunay triangulations of sets of points in R^3 under certain practical geometric constraints. The spread of a set of points is the ratio between the…