Open Access. Powered by Scholars. Published by Universities.®

Geometry and Topology Commons™

Open Access. Powered by Scholars. Published by Universities.®

Articles 61 - 64 of 64

Full-Text Articles in Geometry and Topology

Locked And Unlocked Polygonal Chains In 3d, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides Jan 1999

Locked And Unlocked Polygonal Chains In 3d, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides

Computer Science: Faculty Publications

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 straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called locked. While there are open chains in 3D that are locked, we show that if an open chain has a …


Computational Geometry Column 33, Joseph O'Rourke Jun 1998

Computational Geometry Column 33, Joseph O'Rourke

Computer Science: Faculty Publications

Several recent SIGGRAPH papers on surface simplification are described.


Computational Geometry Column 34, Pankaj K. Agarwal, Joseph O'Rourke Jan 1998

Computational Geometry Column 34, Pankaj K. Agarwal, Joseph O'Rourke

Computer Science: Faculty Publications

Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.


Computational Geometry Column 32, Joseph O'Rourke Oct 1997

Computational Geometry Column 32, Joseph O'Rourke

Computer Science: Faculty Publications

The proof of Dey's new k-set bound is illustrated.