An energy-driven approach to linkage unfolding

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 134-143

  Cantarella, Jason H ^a   Demaine, Erik D ^b   Iben, Hayley N ^c   O'Brien, James F ^c  

^a UNIVERSITY OF GEORGIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Carpenter's rule problem; Computational geometry; Gradient flow; Knot energy; Linkage reconfiguration; Unfolding

Indexed keywords

ALGORITHMS; ANIMATION; COMPUTER GRAPHICS; FUNCTIONS; INTERPOLATION; POLYNOMIALS; PROBLEM SOLVING; ROBOTIC ARMS;

CARPENTER'S RULE PROBLEM; GRADIENT FLOW; KNOT ENERGY; LINKAGE CONFIGURATION; UNFOLDING;

COMPUTATIONAL GEOMETRY;

EID: 4544322157     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997840     Document Type: Conference Paper

References (12)

1. http://www.cs.berkeley.edu/~job/Projects/Unfold/.
2. Aaron Abrams, Jason Cantarella, Joseph H.G. Fu, Mohammad Ghomi, and Ralph Howard. Circles minimize most knot energies. Topology, 42(2):381-394, 2002.
3. Helmut Alt, Christian Knauer, Guenter Rote, and Sue White-sides. The complexity of (un)folding. In Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, California, June 2003. To appear.
4. Dimitris Bertsimas and Santosh Vempala. Solving convex programs by random walks. In Proceedings of the 34rd ACM Symposium on the Theory of Computing, pages 109-115, 2002.
5. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. Locked and unlocked polygonal chains in three dimensions. Discrete & Computational Geometry, 26(3):283-287, October 2001.
6. Jason Cantarella and Heather Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. Journal of Knot Theory and Its Ramifications, 7(8):1027-1039, 1998.
7. Roxana Cocan and Joseph O'Rourke. Polygonal chains cannot lock in 4D. Discrete & Computational Geometry, 20(3): 105-129, November 2001.
8. Robert Connelly, Erik D. Demaine, and Günter Rote. Straightening polygonal arcs and convexifying polygonal cycles. Technical Report B 02-02, Fachbereich Mathematik und Informatik, Serie B - Informatik, Freie Universität Berlin, February 2002.
9. Robert Connelly, Erik D. Demaine, and Günter Rote. Straightening polygonal arcs and convexifying polygonal cycles. Discrete & Computational Geometry, 30(2):205-239, September 2003. Preliminary version appeared at FOCS 2000.
10. Yuanan Diao, Claus Ernst, and E.J. Janse Van Rensburg. Properties of knot energies. In Topology and Geometry in polymer science (Minneapolis, MN 1996), pages 37-47. Springer, New York, 1998.
11. Martin Grötschel, Laszlo Lovász, and Alexander Schrijver, Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin Heidelberg, 1988. 2nd edition 1994.
12. Ileana Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 443-453, Redondo Beach, California, November 2000.