26 citations · 72 across the 33 of their papers we have counts for
Showing 1998 · cs.CGShow all
3 papers · 2 filters
cs.CG1998
Locked and Unlocked Polygonal Chains in 3D
T. Biedl, E. Demaine, M. Demaine +8
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a stra…
cs.CG1998
Computational Geometry Column 32
Joseph O'Rourke
The proof of Dey's new k-set bound is illustrated.
cs.CG1998
Computational Geometry Column 33
Joseph O'Rourke
Several recent SIGGRAPH papers on surface simplification are described.