Visualizing the tightening of knots

Proceedings of the IEEE Visualization Conference

Volumn , Issue , 2005, Pages 73-

  Cantarella, Jason ^a   Piatek, Michael ^b   Rawdon, Eric ^c  

^a UNIVERSITY OF GEORGIA   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c DUQUESNE UNIVERSITY   (United States)

Author keywords

Collision detection; Constrained least squares; Contact; Flexible models; Ideal knots; Nonlinear optimization; Ropelength; Tight knots

Indexed keywords

COLLISION DETECTION; CONSTRAINED LEAST SQUARES; CONTACT; FLEXIBLE MODELS; IDEAL KNOTS; NONLINEAR OPTIMIZATION; ROPELENGTH; TIGHT KNOTS;

ANIMATION; COMPUTER GRAPHICS; COMPUTER SIMULATION; NATURAL SCIENCES COMPUTING; OPTIMIZATION; PROBLEM SOLVING;

VISUALIZATION;

EID: 33749424947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VIS.2005.129     Document Type: Conference Paper

References (41)

1. Ted Ashton and Jason Cantarella. A fast octree-based algorithm for computing ropelength. arXiv:math.DG/0409416, 2004.
2. Kendall E. Atkinson. An Introduction to Numerical Analysis. Wiley, 1989. Section 5.7 covers numerical differentiation.
3. David Baraff. Fast contact force computation for nonpenetrating rigid bodies. In SIGGRAPH'94: Proceedings of the 21st annual conference on Computer graphics and interactive techniques, pages 23-34. ACM Press, 1994.
4. Joel Brown, Jean-Claude Latombe, and Kevin Montgomery. Real-time knot-tying simulation. The Visual Computer, 20:165-179, 2004.
5. Gregory Buck and Jeremey Orloff. A simple energy function for knots. Topology Appl., 61(3):205-214, 1995.
6. R. V. Buniy and T. W. Kephart. Glueballs and the universal energy spectrum of tight knots and links. arXiv:hep-ph/0408027, 2004.
7. Jason Cantarella, Joseph H.G. Fu, Robert B. Kusner, John M. Sullivan, and Nancy C. Wrinkle. Criticality for the Gehring link problem. arXiv:math.DG/0402212, 2004.
8. Jason Cantarella, Robert B. Kusner, and John M. Sullivan. On the minimum ropelength of knots and links. Invent. Math., 150(2):257-286, 2002.
9. Jason Cantarella and Michael Piatek. TSNNLS: A solver for large sparse least-squares problems with non-negative variables. arXiv:cs.MS/0408029.
10. M. Carlen, B. Laurie, J.H. Maddocks, and J. Smutny. Biarcs, Global Radius of Curvature, and the Computation of Ideal Knot Shapes. World Scientific, 2005.
11. S. S. Chern. Curves and surfaces in Euclidean space. In Studies in Global Geometry and Analysis, pages 16-56. Math. Assoc. Amer. (distributed by Prentice-Hall, Englewood Cliffs, N.J.), 1967.
12. Kai-Seng Chou and Xi-Ping Zhu. The Curve Shortening Problem. CRC Press, 2001.
13. Frank H. Clarke. Generalized gradients and applications. Trans. Amer. Math. Soc., 205:247-262, 1975.
14. R. Fletcher. Practical methods of optimization. Wiley-Interscience [John Wiley & Sons], New York, second edition, 2001.
15. O. Gonzalez and R. de la Llave. Existence of ideal knots. J. Knot Theory Ramifications, 12(1):123-133, 2003.
16. O. Gonzalez, J. H. Maddocks, F. Schuricht, and H. von der Mosel. Global curvature and self-contact of nonlinearly elastic curves and rods. Calc. Var. Partial Differential Equations, 14(1):29-68, 2002.
17. Leonidas Guibas, An Nguyen, Daniel Russel, and Li Zhang. Collision detection for deforming necklaces. In SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry, pages 33-42. ACM Press, 2002.
18. Otto Krötenheerdt and Sigrid Veit. Zur Theorie massiver Knoten. Wiss. Beitr. Martin-Luther-Univ. Halle-Wittenberg Reihe M Math., 7:61-74, 1976.
19. Ben Laurie. Annealing ideal knots and links: methods and pitfalls. In Ideal knots, volume 19 of Ser. Knots Everything, pages 42-51. World Sci. Publishing, River Edge, NJ, 1998.
20. R. A. Litherland, J. Simon, O. Durumeric, and E. Rawdon. Thickness of knots. Topology Appl., 91(3):233-244, 1999.
21. I. Lotan, F. Schwarzer, D. Halperin, and J.-C. Latombe. Efficient maintenance and self-collision testing for kinematic chains. In Proc. 18th ACM Symposium on Computational Geometry, pages 43-52, 2002.
22. P. Lötstedt. Coulomb friction in two-dimensional rigid body systems. Zeitschrift für Angewandte Mathematik un Mechanik, 61:605-615, 1981.
23. Victor J. Milenkovic and Harald Schmidl. Optimization-based animation. In SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, pages 37-46, New York, NY, USA, 2001. ACM Press.
24. J. J. Moreau. Quadratic programming in mechanics: Dynamics of one-sided constraints. SIAM Journal on Control, 4(1):153-158, 1966.
25. Alexander Nabutovsky. Non-recursive functions, knots "with thick ropes", and self-clenching "thick" hyperspheres. Comm. Pure Appl. Math., 48(4):381-428, 1995.
26. Christopher C. Paige and Michael A. Saunders. LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw., 8(1):43-71, 1982.
27. Mark Pauly, Dinesh K. Pai, and Leonidas J. Guibas. Quasi-rigid objects in contact. In SCA '04: Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation, pages 109-119, New York, NY, USA, 2004. ACM Press.
28. J. Phillips, A. Ladd, and L. Kavraki. Simulated knot tying, 2002.
29. P. Pieranski, S. Przybyl, and A. Stasiak. Gordian unknots. arXiv:physics/0103080, 2004.
30. Piotr Pierański. In search of ideal knots. In Ideal knots, volume 19 of Ser. Knots Everything, pages 20-41. World Sci. Publishing, River Edge, NJ, 1998.
31. Luís F. Portugal, Joaquím J. Júdice, and Luís N. Vicente. A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Math. Comp., 63(208):625-643, 1994.
32. M. J. D. Powell. Introduction to constrained optimization. In Numerical methods for constrained optimization (Proc. Sympos., National Physical Lab., Teddington, 1974), pages 1-28. Academic Press, London, 1974.
33. Eric Rawdon. The Thickness of Polygonal Knots. PhD thesis, The University of Iowa, 1997.
34. Eric J. Rawdon. Approximating the thickness of a knot. In Ideal knots, volume 19 of Ser. Knots Everything, pages 143-150. World Sci. Publishing, River Edge, NJ, 1998.
35. Eric J. Rawdon. Approximating smooth thickness. J. Knot Theory Ramifications, 9(1):113-145, 2000.
36. Eric J. Rawdon. Can computers discover ideal knots? Experiment. Math., 12(3):287-302, 2003.
37. Robert G. Scharein. KnotPlot. http://www.knotplot.com, 2005. Program for drawing, visualizing, manipulating, and energy minimizing knots.
38. Friedemann Schuricht and Heiko von der Mosel. Characterization of ideal knots. Calc. Var. Partial Differential Equations, 19(3):281-305, 2004.
39. A. Stasiak, V. Katritch, J. Bednar, D. Michoud, and J. Dubochet. Electrophoretic mobility of DNA knots. Nature, 384:122, November 1996.
40. J. Stoer and Ch. Witzgall. Convexity and optimization infinite dimensions, volume I. Springer-Verlag, 1970.
41. Sivan Toledo, Vladimir Rotkin, and Doron Chen. TAUCS: A library of sparse linear solvers, 2003. http://www.tau.ac.il/~stoledo/taucs/.