Name
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. |
Year | Venue | Keywords |
|---|---|---|
2004 | Clinical Orthopaedics and Related Research | computational geometry,discrete mathematics |
Field | DocType | Volume |
Interlocking,Simulation,Computer science,Control engineering,Interlock | Journal | cs.CG/0410 |
Citations | PageRank | References |
1 | 0.43 | 3 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julie Glass | 1 | 2 | 1.82 |
| Stefan Langerman | 2 | 831 | 101.66 |
| Joseph O'Rourke | 3 | 1636 | 439.71 |
| Jack Snoeyink | 4 | 2842 | 231.68 |
| Jianyuan K. Zhong | 5 | 1 | 0.77 |