Ropelength of tight polygonal knots
Abstract
A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is shown. Two ways of calculating the ropelength of tight polygonal knots are compared. An analytical calculation performed for a model knot shows that an appropriately weighted average should provide a good estimation of the minimum ropelength for relatively small numbers of edges.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.