Solving geometric constraints by iterative projections and backprojections

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2004, Issue 2, 2004, Pages 1789-1794

  Thomas, Federico ^a  

^a INSTITUT DE ROBÒTICA I INFORMÀTICA INDUSTRIAL CSIC UPC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; CONSTRAINT THEORY; INVERSE KINEMATICS; ITERATIVE METHODS; MANIPULATORS;

CONSTRAINT-BASED SKETCHING; GEOMETRIC CONSTRAINTS; ITERATIVE PROJECTIONS; PARALLEL MANIPULATORS;

ROBOTICS;

EID: 3042675975     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/robot.2004.1308083     Document Type: Conference Paper

References (21)

1. G. Alefeld and J. Herzberger, Introduction to Interval Computations, Academis Press, New York, 1983.
2. G. Alefeld and G. Mayer, "The Cholesky method for interval data," Linear Algebra and its applications, Vol. 194, pp. 161-182, 1993.
3. A.Y. Alfakih, A. Khandani, and H. Wolkowicz, "Solving Euclidean distance matrix completion problems via Semideinite Programming," Computational Optimization and Applications, Vol. 12, No. 1-3, pp. 13-30, 1999.
4. L.M. Blumenthal, Theory and Applications of Distance Geometry, Oxford University Press, 1953.
5. A. Cayley, "A theorem in the Geometry of Position," Cambridge Mathematical Journal, Vol. II, pp. 267-271, 1841. (Also in Collected Mathematical Papers of Arthur Cayley, Cambridge University Press, 1963).
6. A. Cayley, "A theorem in the Geometry of Position," Cambridge Mathematical Journal, Vol. II, pp. 267-271, 1841. (Also in Collected Mathematical Papers of Arthur Cayley, Cambridge University Press, 1963).
7. G.M. Crippen and T. Havel, Distance Geometry and Molecular Conformation, John Wiley and Sons Inc., New York, 1988.
8. A.W.M. Dress and T.F. Havel, "Shortest-path problems and molecular conformation," Discrete Applied Mathematics, Vol. 19, pp. 129-144, 1988.
9. I.Z. Emiris and B. Mourrain, "Computer algebra methods for studying and computing molecular conformations," Algorithmica, No. 25, pp. 372-402, 1999.
10. G.I. Hargreaves, "Interval Analysis in MATLAB," Numerical Analysis Report No. 416, Manchester Center for Computational Mathematics, 2002.
11. C.H. Hoffmann and B. Yuan, "On spatial constraint solving approaches," in Automated Deduction in Geometry: Third International Workshop, LNCS No. 2061, Springer Verlag, 2000.
12. M.K. Kim, G.S. Chirikjian, and R.L. Jernigan, "Elastic models of conformational transitions in macromolecules," Journal of Molecular Graphics and Modelling
13. M. Laurent, "A connection between positive semidefinite and Euclidean distance matrix completion problems," Lineal Algebra and its Applications, Vol. 273, No. 1-3, pp. 9-22, 1998.
14. K. Menger, "New foundation for Euclidean geometry," American Journal of Mathematics, No. 53, pp. 721-745, 1931.
15. J. Nielsen and B. Roth, "Formulation and solution for the direct and inverse kinematics problems for mechanisms and mechatronic systems," Proc. of the NATO Advanced Institute on Computational Methods in Mechanisms, I. Angeles and E. Zakhariev, Eds., Vol. I, pp. 233-252, 1997.
16. T.G. Nikitopoulos and I.Z. Emiris, "Molecular conformation search by matrix perturbations," preprint.
17. J.M. Porta, L. Ros, F. Thomas, and C. Torras, "A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints," IEEE Trans. on Robotics and Automation, to appear.
18. K. Rajan and N. Deo, "A parallel algorithm for bound-smoothing using tetrangle inequality," Proc. of the IPPS/SPDP, pp. 645-652, 1998.
19. J.B. Saxe, "Embedadbility of weighted graphs in k-space is strongly NP-hard," Proc. of the 17th Allerton Conference in Communications, Control and Computing, pp 480-489, 1979.
20. I.J. Schoenberg, "Remarks to a M. Fréchet's article," Annals of Mathematics, Vol. 36, pp. 724-732, 1935.
21. G.W. Steward, Matrix Algorithms. Volume I: Basic Decompositions, SIAM, Philadelphia, 1998.