A 2-Chain Can Interlock With a k-Chain

Authors

Julie Glass, California State University, Hayward
Stefan Langerman, Universite Libre de Bruxelles
Joseph O'Rourke, Smith CollegeFollow
Jack Snoeyink, University of North Carolina at Chapel Hill
Jianyuan K. Zhong, California State University, Sacramento

Document Type

Article

Publication Date

2004

Publication Title

Proceedings of the 14th Annual Fall Workshop on Computational Geometry

Abstract

One of the open problems posed in [3] is: what is the minimal number k such that an open, flexible k-chain can interlock with a flexible 2-chain? In this paper, we establish the assumption behind this problem, that there is indeed some k that achieves interlocking. We prove that a flexible 2-chain can interlock with a flexible, open 16-chain.

Comments

Author’s submitted manuscript. Final version available at http://cgw2004.csail.mit.edu/talks/.

Recommended Citation

Glass, Julie; Langerman, Stefan; O'Rourke, Joseph; Snoeyink, Jack; and Zhong, Jianyuan K., "A 2-Chain Can Interlock With a k-Chain" (2004). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/47