←back to thread

A fast 3D collision detection algorithm

(cairno.substack.com)
269 points OlympicMarmoto | 1 comments | 09 Jul 25 14:12 UTC | HN request time: 0.21s | source

I discovered this collision detection algorithm during COVID and finally got around to writing about it.

github repo: https://github.com/cairnc/sat_blog

Show context
reactordev ◴[09 Jul 25 16:03 UTC] No.44511689[source]▶
This is novel indeed! What about non-spherical shapes? Do we assume a spherical bounds and just eat the cost? Either way, narrow phase gets extremely unwieldy when down to the triangle level. Easy for simple shapes but if you throw 1M vertices at it vs 1M vertices you’re going to have a bad time.

Any optimization to cut down on ray tests or clip is going to be a win.

replies(5): >>44511963 #>>44512034 #>>44512617 #>>44512959 #>>44513664 #
1. OlympicMarmoto ◴[09 Jul 25 17:21 UTC] No.44512617[source]▶
Do you mean non-convex shapes? You can do a convex decomposition and then test all pairs. Usually games accelerate this with a BVH.