A fast algorithm for incremental distance calculation

A simple and efficient algorithm for finding the closest points between two convex polynomials is described. Data from numerous experiments tested on a broad set of convex polyhedra on R/sup 3/ show that the running time is roughly constant for finding closest points when nearest points are approximately known and is linear in total number of vertices if no special initialization is done. This algorithm can be used for collision detection, computation of the distance between two polyhedra in three-dimensional space, and other robotics problems. It forms the heart of the motion planning algorithm previously presented by the authors (Proc. IEEE ICRA, p.1554-9, 1990).<<ETX>>

[1]  Philip Wolfe,et al.  Finding the nearest point in A polytope , 1976, Math. Program..

[2]  John W. Boyse,et al.  Interference detection among solids and surfaces , 1979, CACM.

[3]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[4]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  W. Edward Red,et al.  Minimum distances for robot task simulation , 1983, Robotica (Cambridge. Print).

[6]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[7]  B. Donald.  Motion Planning with Six Degrees of Freedom , 1984 .

[8]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[9]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

[10]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[11]  S. A. Cameron,et al.  Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[12]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[14]  Elmer G. Gilbert,et al.  A new algorithm for detecting the collision of moving objects , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[15]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[16]  Elmer G. Gilbert,et al.  Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..