Proceedings of the Annual Symposium on Computational Geometry
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.
Configurations, Geometry, Knots, Linkages, Protein Models, Robotic Arms
© the authors
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.