Interlocked open and closed linkages with few joints

Authors:
Erik D. Demaine;Stefan Langerman;Joseph O'Rourke;Jack Snoeyink
Affiliations:
MIT Laboratory for Computer Science, 200 Technology Square, Cambridge, MA;School of Computer Science, McGill University, 3480 University Street, Suite 318, Montreal, QC, H3A 2A7, Canada;Department of Computer Science, Smith College, Northampton, MA;Department of Computer Science, UNC Chapel Hill, Chapel Hill, NC
Venue:
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Year:
2003

Citing 1
Cited 2

Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

Interlocked open linkages with few joints

Proceedings of the eighteenth annual symposium on Computational geometry
Minimal Locked Trees

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.