Computer Science – Computational Geometry
Scientific paper
2004-10-20
Computer Science
Computational Geometry
10 pages, 6 figures
Scientific paper
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.
Glass Julie
Langerman Stefan
O'Rourke Joseph
Snoeyink Jack
Zhong Jianyuan K.
No associations
LandOfFree
A 2-chain can interlock with a k-chain does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A 2-chain can interlock with a k-chain, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A 2-chain can interlock with a k-chain will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-536655