Fast versions of the Gilbert-Johnson-Keerthi distance algorithm: Additional results and comparisons

IEEE Transactions on Robotics and Automation

Volumn 17, Issue 4, 2001, Pages 531-539

  Ong, Chong Jin ^a   Gilbert, Elmer G ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; DISTANCE MEASUREMENT;

CONVEX POLYTOPES;

MOTION PLANNING;

EID: 0035428370     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.954768     Document Type: Article

References (13)

1. Enhancing GJK: Computing minimum and penetration distances between convex polyhedra
2. A comparison of two fast algorithms for computing the distance between convex polyhedra
3. I-COLLIDE: An interactive and exact collision detection system for large-scale environments
4. A fast procedure for computing the distance between complex objects in three-dimensional space
5. Computing the distance between general convex objects in three dimensional space
6. A fast algorithm for incremental distance calculation
7. V-Clip: Fast and robust polyhedral collision detection
8. The Gilbert-Johnson-Keerthi algorithm: A fast version for incremental motions
9. Incremental algorithms for collision detection between polygonal models
10. Efficient collision detection for convex and nonconvex objects