72 citations · 218 across the 15 of their papers we have counts for
4 papers · 1 filter
Emerging Challenges in Computational Topology
Marshall Bern, David Eppstein, Pankaj K. Agarwal +19
Here we present the results of the NSF-funded Workshop on Computational Topology, which met on June 11 and 12 in Miami Beach, Florida. This report identifies important problems inv…
Quadrilateral Meshing by Circle Packing
Marshall Bern, David Eppstein
We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these meth…
Ununfoldable Polyhedra with Convex Faces
Marshall Bern, Erik D. Demaine, David Eppstein +3
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the s…
Hinged Dissection of Polyominoes and Polyforms
Erik D. Demaine, Martin L. Demaine, David Eppstein +2
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection o…