Rare card
Gilbert–Johnson–Keerthi distance algorithm
- Value
- 50 W
- Attack
- 730
- Defence
- 584
- Players
- 0
The Gilbert–Johnson–Keerthi distance algorithm is a method of determining the minimum distance between two convex sets, first published by Elmer G. Gilbert, Daniel W. Johnson, and S. Sathiya Keerthi in 1988.
Get Gilbert–Johnson–Keerthi distance algorithm in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack