Abstract

The problem of tracking the distance between two convex polyhedra is finding applications in many areas of robotics, including intersection detection, collision detection, and path planning. We present new results that confirm an almost-constant time complexity for an enhanced version of Gilbert, Johnson and Keerthi's algorithm, and also describe modifications to the algorithm to compute measures of penetration distance.

Citations

246	A Fast Procedure for Computing the Distance Between Complex Objects in Three-Dimensional Space - Gilbert, Johnson, et al. - 1988
148	A fast algorithm for incremental distance calculation - Lin, Canny - 1991
75	Incremental algorithms for collision detection between polygonal models - Ponamgi, Manocha, et al. - 1997
50	R.K.: Determining the Minimum Translational Distance between Two Convex Polyhedra - Cameron, Culley - 1986
37	Computing the distance between general convex objects in three-dimensional space - Gilbert, Foo - 1994
29	A comparison of two fast algorithms for computing the distance between convex polyhedra - Cameron - 1997
21	Local motion planning for manipulators based on shrinking and growing geometry models - Baginski - 1996
16	New distances for the separation and penetration of objects - Gilbert, Ong - 1994
11	A Proximity Metric For Continuum Path Planning - Buckley, Leifer - 1985
11	Towards efficient motion planning for manipulators with complex geometry - Qin, Cameron, et al. - 1995
6	Efficient Collision Detection Using Fast Distance-Calculation Algorithms For Convex And Non-Convex Objects - Sato - 1996
5	Spatial planning---a configuration space approach - Lozano-P'erez - 1983