Efficient distance computation between non-convex objects

This paper describes an efficient algorithm for computing the distance between nonconvex objects. Objects are modeled as the union of a set of convex components. From this model we construct a hierarchical bounding representation based on spheres. The distance between objects is determined by computing the distance between pairs of convex components using preexisting techniques. The key to efficiency is a simple search routine that uses the bounding representation to ignore most of the possible pairs of components. The efficiency can further be improved by accepting a relative error in the returned result. Several empirical trials are presented to examine the performance of the algorithm.<<ETX>>

[1]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[2]  David F. Rogers,et al.  Procedural Elements for Computer Graphics , 1984 .

[3]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[4]  Vladimir J. Lumelsky,et al.  On Fast Computation of Distance Between Line Segments , 1985, Information Processing Letters.

[5]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[7]  James E. Bobrow,et al.  Optimal robot plant planning using the minimum-time criterion , 1988, IEEE J. Robotics Autom..

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

[9]  Bernard Faverjon,et al.  Hierarchical object models for efficient anti-collision algorithms , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[10]  James E. Bobrow,et al.  A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra , 1989, Int. J. Robotics Res..

[11]  David Baraff,et al.  Analytical methods for dynamic simulation of non-penetrating rigid bodies , 1989, SIGGRAPH.

[12]  David G. Kirkpatrick,et al.  Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.

[13]  David Baraff,et al.  Curved surfaces and coherence for non-penetrating rigid body simulation , 1990, SIGGRAPH.

[14]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[15]  Ming C. Lin,et al.  A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[16]  Andrew P. Witkin,et al.  Dynamic simulation of non-penetrating flexible bodies , 1992, SIGGRAPH.

[17]  Angel P. del Pobil,et al.  A new representation for collision avoidance and detection , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[18]  D. Baraff.  Dynamic simulation of nonpenetrating rigid bodies , 1992 .

[19]  Ming C. Lin,et al.  Efficient collision detection for animation and robotics , 1993 .

[20]  Oussama Khatib,et al.  Elastic bands: connecting path planning and control , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[21]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

[22]  David Baraff,et al.  Interactive simulation of solid rigid bodies , 1995, IEEE Computer Graphics and Applications.

[23]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[24]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.