Document Type

Conference Proceeding

Publication Date

8-1-2003

Publication Title

Computational Geometry: Theory and Applications

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.

Keywords

Configurations, Knots, Linkages in S 3

Volume

26

Issue

1

First Page

37

Last Page

45

DOI

10.1016/S0925-7721(02)00171-2

ISSN

09257721

Rights

© 2003 Elsevier Science B.V. All rights reserved.

Comments

Archived as published. Open access paper.

Download

Share

COinS