12 citations · 25 across the 4 of their papers we have counts for
Showing 2001 · cs.CGShow all
3 papers · 2 filters
cs.CG2001
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…
cs.CG2001
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…
cs.CG2001
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…