1. and Towards efficient motion planning for manipulators with complex geometry, Proc IEEE Int Symp Assembly Task Planning. Pittsburgh, August 1995, pp. 207-212.
2. A fast procedure for computing the distance between complex objects in three-dimensional space
3. A comparison of two fast algorithms for computing the distance between convex polyhedra
4. Enhancing GJK: computing minimum and penetration distances between convex polyhedra, IEEE Int Conf Robotics Automat, Albuquerque, April 1997, pp. 3112-3117.
5. and A fast algorithm for incremental distance calculation, IEEE Int Conf Robotics Automat Sacramento, April 1991, pp. 1008-1014.