Interlocked open linkages with few joints

Authors:
Erik D. Demaine;Stefan Langerman;Joseph O'Rourke;Jack Snoeyink
Affiliations:
MIT, Cambridge, MA;McGill University;Smith College, Northampton, MA;University of North Carolina, Chapel Hill, NC
Venue:
Proceedings of the eighteenth annual symposium on Computational geometry
Year:
2002

Citing 4
Cited 3

Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Locked and unlocked polygonal chains in 3D

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Interlocked open and closed linkages with few joints

Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Geometric and computational aspects of molecular reconfiguration

Geometric and computational aspects of molecular reconfiguration

The complexity of (un)folding

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

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On unfolding lattice polygons/trees and diameter-4 trees

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.