Get the latest tech news

The GJK Algorithm: A weird and beautiful way to do a simple thing

. We have shape A and shape B, and we'd like to determine if they overlap.

The goal of the GJK algorithm is to find a simplex on A ⊖ B that contains the origin (or show that none exists), while doing as few operations as possible. Let's appreciate how incredible such an algorithm would be: given any convex shape, as long as it has some defined notion of support points, we can detect collisions. So, take it with the appropriate amount of salt for a high school sophomore's explanation of anything math related.

Get the Android app