| Language Tag | Language | Region | Description |
|---|---|---|---|
| ar-SA | Arabic | Saudi Arabia | Arabic (Saudi Arabia) |
| bn-BD | Bangla | Bangladesh | Bangla (Bangladesh) |
| bn-IN | Bangla | India | Bangla (India) |
| cs-CZ | Czech | Czech Republic | Czech (Czech Republic) |
| da-DK | Danish | Denmark | Danish (Denmark) |
| de-AT | German | Austria | Austrian German |
| de-CH | German | Switzerland | "Swiss" German |
| de-DE | German | Germany |
The Gilbert–Johnson–Keerthi (GJK) distance algorithm is a method of determining the minimum distance between two convex sets. The algorithm's stability, speed which operates in near-constant time, and small storage footprint make it popular for realtime collision detection.
Unlike many other distance algorithms, it has no requirments on geometry data to 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.