A comparison of two fast algorithms for computing the distance between convex polyhedra

IEEE Transactions on Robotics and Automation

Volumn 13, Issue 6, 1997, Pages 915-920

  Cameron, Stephen ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Closest points; Convex polyhedra; Distance computations; Simulation; Tracking

Indexed keywords

CALCULATIONS; COMPUTER SIMULATION; DISTANCE MEASUREMENT; ROBOTICS; TRACKING (POSITION);

CONVEX POLYHEDRA; FAST ALGORITHM;

ALGORITHMS;

EID: 0031336274     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.650170     Document Type: Article

References (8)

1. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi, "A fast procedure for computing the distance between complex objects in three-dimensional space," IEEE Trans. Robot. Automat., vol. 4, pp. 193-203, Apr. 1988.
2. M. Lin and J. Canny, "A fast algorithm for incremental distance calculation," in IEEE Int. Conf. Robot. Automat., Sacramento, CA, Apr. 1991, pp. 1008-1014.
3. E. G. Gilbert and C-K Foo, "Computing the distance between general convex objects in three-dimensional space," IEEE Trans. Robot. Automat., vol. 6, pp. 53-61, Feb. 1990.
4. J. Cohen, M. Lin, D. Manocha, and K. Ponamgi, "I-COLLIDE: An interactive and exact collision detection system for large scale environments," in Int. 3-D Graphics Conf., Monterey, Apr. 1995, pp. 189-196.
5. C. Qin, S. Cameron, and A. McLean, "Toward efficient motion planning for manipulators with complex geometry," in Proc. IEEE Int. Symp. Assembly Task Planning, Pittsburgh, PA, Aug. 1995, pp. 207-212.
6. Y. Sato, M. Hirata, T. Maruyama, and Y. Arita, "Efficient collision detection using fast distance-calculation algorithms for convex and nonconvex objects," in IEEE Int. Conf. Robot. Automat., Minneapolis, MN, Apr. 1996, pp. 771-778.
7. S. A. Cameron and R. K. Culley, "Determining the minimum translational distance between two convex polyhedra," in IEEE Int. Conf. Robot. Automat., San Francisco, CA, Apr. 1986, pp. 591-596.
8. S. Cameron, " Enhancing GJK: computing minimum and penetration distances between convex polyhedra," in IEEE Int. Conf. Robot. Automat., Albuquerque, NM, Apr. 1997, pp. 3112-3117.