Iterative algorithm for finding a nearest pair of points in two convex subsets of Rn

Computers and Mathematics with Applications

Volumn 40, Issue 8, 2000, Pages 971-983

  Llanas, B ^a   Fernandez De Sevilla, M ^a   Feliu, V ^b  

^a ETSI de Caminos Cd Univ   (Spain)

^b ETSI Industriales   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATHEMATICAL OPERATORS; SET THEORY;

EUCLIDEAN DISTANCE; FIXED-POINT THEORY; HILBERT SPACE METHODS; NONEXPANSIVE OPERATORS;

COMPUTATIONAL GEOMETRY;

EID: 0342955012     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(00)85008-7     Document Type: Article

References (23)

1. Burdea G.C. Force and Touch Feedback for Virtual Reality. 1996;Wiley.
2. Schwartz J.T. Finding the minimum distance between two convex polygons. Info. Proc. Lett. 13:1981;168-170.
3. Chin F., Wang C.A. Optimal algorithms for the intersection and the minimum distance problems between planar polygons. IEEE Trans. Comp. C-32:1983;1203-1207.
4. th Internat. Colloq. Automata Lang. Program. 1990;400-413 Springer-Verlag, New York.
5. Red W.E. Minimum distances for robot task simulation. Robotica. 1:1983;231-238.
6. Bobrow J.E. A direct minimization approach for obtaining the distance between convex polyhedra. International Journal of Robotics Research. 8:1989;65-76.
7. Lin M. Efficient Collision Detection for Animation and Robotics. Ph.D. Thesis. 1993;University of California, Berkeley.
8. B. Llanas, M. Fernández de Sevilla and V. Feliú, A quasilocal descent-projection method for finding the distance between two convex polyhedra, (submitted).
9. Gilbert E.G., Foo C.-P. Computing the distance between general convex objects in three-dimensional space. IEEE Transactions on Robotics and Automation. 6:(1):1990;53-61.
10. Gilbert E., Johnson D.W., Keerthi S.S. A fast procedure for computing the distance between complex objects in three-dimensional space. I.E.E.E. Journal of Robotics and Automation. 4:1988;193-203.
11. Klosowski J., Held M., Mitchell J., Sowizral H., Zikan K. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans. on Visualization and Computer Graphics. 4:(1):1998;21-36.
12. Fujishige S., Zhan P. A dual algorithm for finding a nearest pair of points in two polytopes. J. of the Operations Research Society of Japan. 35:1992;353-365.
13. Sekitani K., Yamamoto Y. A recursive algorithm for finding the minimum norm point in a polytope and a pair of closed points in two polytopes. 61:1993;233-249.
14. Laurent P.J. Un algorithme dual pour le calcul de la distance entre deux convexes. Dold A., Eckmann B. Optimization and Optimal Control. 1974;202-228 Springer-Verlag, New York.
15. Brezis H. Analyse Fonctionelle. 1983;Masson.
16. Zeidler E. Nonlinear Functional Analysis and its Applications, Volume 1: Fixed-Point Theorems. 1986;Springer-Verlag.
17. Wolfe Ph. Finding the nearest point in a polytope. Mathematical Programming. 11:1976;128-149.
18. Bauschke H.H., Borwein J.M. On projection algorithms for solving convex feasibility problems. SIAM Review. 38:(3):1996;367-426.
19. Llanas B., Moreno C. Finding the projection on a polytope: An iterative method. Computers Math. Applic. 32:(8):1996;33-39.
20. He B., Stoer J. Solution of projection problems over polytopes. Numerische Mathematik. 61:(1):1992;73-90.
21. Glaeser G. Fast Algorithms for 3D-Graphics. 1994;Springer-Verlag.
22. Llanas B., Fernández de Sevilla M. Una versión no recursiva del algoritmo de Sekitani-Yamamoto para encontrar la distancia entre dos poliedros. Sistema de Teleoperación basado en Realidad Virtual. 1996;Comunidad Autónoma de Madrid. Research Report.
23. Cameron S. A comparison of two fast algorithms for computing the distance between convex polyhedra. IEEE Transactions on Robotics and Automation. 4:1997;915-920.