A fast octree-based algorithm for computing ropelength

MaRDI QIDQ5477844zbMATH OpenFDO

Authors Ted Ashton, Jason Cantarella

Publication date 29 June 2006

Full work available at URL https://arxiv.org/abs/math/0409416

zbMATH Keywords

octreeropelengththickness

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Knot tightening by constrained gradient descent
• Ropelength of tight polygonal knots
• Can Computers Discover Ideal Knots?
• APPROXIMATING SMOOTH THICKNESS
• scientific article; zbMATH DE number 1877242

Cited in

(6)

• Shape optimization of self-avoiding curves
• Stable length estimates of tube-like shapes
• Ropelength criticality
• Knot tightening by constrained gradient descent
• Ropelength of tight polygonal knots
• A descent scheme for thick elastic curves with self-contact and container constraints

This page was built for publication: A fast octree-based algorithm for computing ropelength

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477844)