Showing cs.CGShow all
3 papers · 1 filter
cs.CG2004
A 2-chain can interlock with a k-chain
Julie Glass, Stefan Langerman, Joseph O'Rourke +2
One of the open problems posed in [3] is: what is the minimal number k such that an open, flexible k-chain can interlock with a flexible 2-chain? In this paper, we establish the as…
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
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…