GJK Algorithm Explanation & Implementation
Spheres are nice and all, but there comes a time when more complex shapes are needed. One popular algorithm for testing collisions is the Gilbert–Johnson–Keerthi algorithm, or GJK for short. With it we can detect collisions between any two convex polygons. Check out the full article: https://blog.winter.dev/2020/gjk-algo... Intro- 0:00 Sphere vs Polygons: 0:17 Supporting Points: 1:20 GJK: 3:20

▶︎
A Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm)

▶︎
Improving the GJK Algorithm for Faster and More Reliable Distance Queries Between Convex Objects

▶︎
Convex Polygon Collisions #1

▶︎
The most beautiful formula not enough people understand

▶︎
EPA Explanation & Implementation

▶︎
BSP Trees: The Magic Behind Collision Detection in Quake

▶︎
Visualizing Collision Detection -- Separating Axis Theorem Explained with a Minecraft Datapack

▶︎
The Midpoint Circle Algorithm Explained Step by Step

▶︎
Why colliding blocks compute pi

▶︎
Watch This For 18 Minutes, and You’ll Outlearn 99.9% Of People

▶︎
The Game You Can't Fail

▶︎
Extreme SIMD: Optimized Collision Detection in Titanfall
![PINK & ORANGE GRADIENT IN HD [3 HOURS]](https://i.ytimg.com/vi/6ih8zppfQSQ/hq720.jpg?sqp=-oaymwE1CNAFEJQDSFryq4qpAycIARUAAIhCGAHwAQH4Af4JgALQBYoCDAgAEAEYfyAsKBMwD7gC9xg=&rs=AOn4CLAUEb5z8CwP9EWlTCjCFdRosNmujA&usqp=CCc)
▶︎
PINK & ORANGE GRADIENT IN HD [3 HOURS]

▶︎
This Paradox Splits Smart People 50/50

▶︎
Building Collision Simulations: An Introduction to Computer Graphics

▶︎
Quadtrees: Blazingly Fast Collision Detection
![Yann LeCun's $1B Bet Against LLMs [Part 1]](https://i.ytimg.com/vi/kYkIdXwW2AE/hq720.jpg?sqp=-oaymwEbCNAFEJQDSFryq4qpAw0IARUAAIhCGAG4AvcY&rs=AOn4CLBvMdKvkZHL9Earmgc5OX3Iuc1UUQ&usqp=CCc)
▶︎
Yann LeCun's $1B Bet Against LLMs [Part 1]

▶︎
A simple procedural animation technique

▶︎
GJK + Expanding Polytope Algorithm - Implementation and Visualization

▶︎
