Gilbert–Johnson–Keerthi distance algorithm: Difference between revisions

Revision as of 13:20, 3 August 2020

Revision as of 18:38, 24 March 2021

Line 1:

{{Short description|Method of determing minimum distance between two convex sets}}

The '''Gilbert–Johnson–Keerthi distance [[algorithm]]''' is a method of determining the minimum distance between two [[convex set]]s. 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 [[simplex|simplices]] to the correct answer using the ''configuration space obstacle'' (CSO) of two convex shapes, more commonly known as the [[Minkowski difference]].