A Fast and Robust GJK Implementation for Collision Detection of Convex Objects

Gino van den Bergen · Journal of Graphics Tools · 1999

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.

Read the paper · More papers on PaperTik