A Fast and Robust GJK Implementation for Collision Detection of Convex Objects
- 1 January 1999
- journal article
- research article
- Published by Taylor & Francis in Journal of Graphics Tools
- Vol. 4 (2), 7-25
- https://doi.org/10.1080/10867651.1999.10487502
Abstract
This paper presents an implementation of the Gilbert-Johnson-Keerthi algorithm for comput ing the distance between convex objects, that has improved performance, robustness, and versatility over earlier implementations. The algorithm presented here is especially suitable for use in collision detection of objects modeled using various types of geometric primitives, such as boxes, cones, and spheres, and their images under affine transformation.Keywords
This publication has 8 references indexed in Scilit:
- Enhancing GJK: computing minimum and penetration distances between convex polyhedraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The Gilbert-Johnson-Keerthi distance algorithm: a fast version for incremental motionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- Quick collision detection of polytopes in virtual environmentsPublished by Association for Computing Machinery (ACM) ,1996
- Fast Collision Detection of Moving Convex PolyhedraPublished by Elsevier ,1994
- Computing the distance between general convex objects in three-dimensional spaceIEEE Transactions on Robotics and Automation, 1990
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988
- Determining the minimum translational distance between two convex polyhedraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986