An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn
Authors:
- B. LlanasBLB. Llanas
- M. Fernandez de SevillaMSM. Fernandez de Sevilla
- V. FeliuV. Feliu
- 1 October 2000
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 40 (8-9) , 971-983
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Efficient collision detection using bounding volume hierarchies of k-DOPsIEEE Transactions on Visualization and Computer Graphics, 1998
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPESJournal of the Operations Research Society of Japan, 1992
- Computing the distance between general convex objects in three-dimensional spaceIEEE Transactions on Robotics and Automation, 1990
- A Direct Minimization Approach for Obtaining the Distance between Convex PolyhedraThe International Journal of Robotics Research, 1989
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar PolygonsIEEE Transactions on Computers, 1983
- Minimum distances for robot task simulationRobotica, 1983
- Finding the minimum distance between two convex polygonsInformation Processing Letters, 1981
- Finding the nearest point in A polytopeMathematical Programming, 1976