Interlocked Open Linkages with Few Joints

Authors

Erik D. Demaine, Massachusetts Institute of Technology
Stefan Langerman, Massachusetts Institute of Technology
Joseph O'Rourke, Massachusetts Institute of TechnologyFollow
Jack Snoeyink, Massachusetts Institute of Technology

Document Type

Conference Proceeding

Publication Date

1-1-2002

Publication Title

Proceedings of the Annual Symposium on Computational Geometry

Abstract

We advance the study of collections of open linkages in 3-space that may be interlocked in the sense that the linkages cannot be separated without one bar crossing through another. We consider chains of bars connected with rigid joints, revolute joints, or universal joints and explore the smallest number of chains and bars needed to achieve interlock. Whereas previous work used topological invariants that applied to single or to closed chains, this work relies on geometric invariants and concentrates on open chains.

Keywords

Configurations, Geometry, Knots, Linkages, Protein Models, Robotic Arms

First Page

189

Last Page

198

DOI

10.1145/513400.513424

Rights

© the authors

Comments

Archived as published.

Recommended Citation

Demaine, Erik D.; Langerman, Stefan; O'Rourke, Joseph; and Snoeyink, Jack, "Interlocked Open Linkages with Few Joints" (2002). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/205