EPA Explanation & Implementation
GJK tells us if there is a collision, but doesn't give enough information to respond to it. In this video I cover a supplemental algorithm called the Expanding Polytope algorithm that uses the pieces from GJK to give us this info. With it we can respond to collisions between any two convex polygons. Check out the full article: https://winter.dev/articles/epa-algor... GJK Tool: https://winter.dev/articles/gjk-algor... Intro: 0:00 Explanation: 0:23 2D Implementation: 1:36 3D Implementation: 2:55 Demos: 5:25
▶︎
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
▶︎
11 - Finding collisions among thousands of objects blazing fast
▶︎
BSP Trees: The Magic Behind Collision Detection in Quake
▶︎
09 Getting ready to simulate the world with XPBD
▶︎
GJK + Expanding Polytope Algorithm - Implementation and Visualization
▶︎
The most beautiful formula not enough people understand
▶︎
How 2D Game Collision Works (Separating Axis Theorem)
▶︎
2D collision detection (SAT)
▶︎
Extreme SIMD: Optimized Collision Detection in Titanfall
▶︎
Count Binface destroys Sky News interviewer
▶︎
Implementing collisions from scratch! Indie Game Devlog #5
▶︎
Convex Polygon Collisions #1
▶︎
When Your Game Is Bad But Your Optimisation Is Genius
▶︎
Building a Physics Engine with C++ and Simulating Machines
▶︎
Why This Is the Most Exciting Time to Be Human | Ken Ono, Axiom Math
▶︎
Writing a Physics Engine from scratch - collision detection optimization
▶︎
I Built a Fake Netflix to Prank My Friends (part 2)
▶︎
"Papers I Have Loved" by Casey Muratori
▶︎