Showing 1999Show all
3 papers · 1 filter
cs.CG1999
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…
cs.CG1999
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…
cs.CG1999
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…