Gilbert–Johnson–Keerthi distance algorithm
The Gilbert–Johnson–Keerthi distance algorithm is a method of determining the minimum distance between two convex sets. Unlike many other distance algorithms, it does not require that the geometry data be stored in any specific format, but instead relies solely on a support function to iteratively generate closer simplices to the correct answer using the Minkowski sum (CSO) of two convex shapes.
"Enhanced GJK" algorithms use edge information to speed up the algorithm by following edges when looking for the next simplex. This improves performance substantially for polytopes with large numbers of vertices.
GJK algorithms are often used incrementally in simulation systems and video games. In this mode, the final simplex from a previous solution is used as the initial guess in the next iteration, or "frame". If the positions in the new frame are close to those in the old frame, the algorithm will converge in one or two iterations. This yields collision detection systems which operate in near-constant time.
- "A fast procedure for computing the distance between complex objects in three-dimensional space", Gilbert, Johnson and Keerthi - the initial publication
- "Computing the Distance between Objects", Oxford professor Stephen Cameron's implementation of GJK
- A 2D implementation of the Gilbert–Johnson–Keerthi (GJK) algorithm, written in the D programming language
|This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.|