Computational Geometry: Theory and Applications
We study collections of linkages in 3-space that are interlocked in the sense that the linkages cannot be separated without one bar crossing through another. We explore pairs of linkages, one open chain and one closed chain, each with a small number of joints, and determine which can be interlocked. In particular, we show that a triangle and an open 4-chain can interlock, a quadrilateral and an open 3-chain can interlock, but a triangle and an open 3-chain cannot interlock.
Configurations, Knots, Linkages in S 3
© 2003 Elsevier Science B.V. All rights reserved.
Demaine, Erik D.; Langerman, Stefan; O'Rourke, Joseph; and Snoeyink, Jack, "Interlocked Open and Closed Linkages with Few Joints" (2003). Computer Science: Faculty Publications, Smith College, Northampton, MA.