52 citations · 270 across the 71 of their papers we have counts for
Showing 2004Show 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.CG2004
Unfolding Smooth Prismatoids
Nadia Benbernou, Patricia Cahn, Joseph O'Rourke
We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth curves lying in parallel planes), has a nonoverlappin…
cs.CG2004
Computational Geometry Column 45
Joseph O'Rourke
The algorithm of Edelsbrunner for surface reconstruction by ``wrapping'' a set of points in R^3 is described.