Efficient Distance Computation Between Non-Convex Objects

This paper describes an efficient algorithm for computing the distance between non-convex 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.

• Type: Conference
• Year: 1994
• Where: ICRA
• Authors: Sean Quinlan
• Keywords: Bounding Representation, Convex Components, Hierarchical Bounding Representation, ICRA 1994, Robotics