A 2-chain can interlock with a k-chain

A 2-chain can interlock with a k-chain

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 c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Glass, Julie, Langerman, Stefan, O'Rourke, Joseph, Snoeyink, Jack, Zhong, Jianyuan K
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computational Geometry
Computer Science - Discrete Mathematics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.cs/0410052