Is it just me or is separating-axis-theorem-based polygon intersection way more straightforward if, for each edge, you just use the edge equation to check whether all points of the other polygon are on the same side of that edge?
Usually I see SAT taught using projection: e.g. https://gamedevelopment.tutsplus.com/tutorials/collision-detection-using-the-separating-axis-theorem--gamedev-169 …
-
-
The separating hyperplane theorem is usually expressed using projections because that works for all convex sets and many relevant convex sets don't have a finite number of vertices. But Sutherland-Hodgman (and derivatives) is still the standard approach for convex _polygons_.
-
It was a lot easier for me to understand starting with S-H as opposed to the other way around. I wish tutorials taught S-H first.
- 7 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.