Geometry
Polygon Clipping (Part 2)
My previous polygon clipping tutorial dove into the Greiner-Hormann clipping algorithm. Unfortunately, this algorithm fails at common cases… so let’s revist the problem and try again.
The F. Martinez 2008 algorithm handles coincident edges (unlike Greiner-Hormann), but it still has some minor goofiness. Let’s solve this problem once and for all.
Polygon Clipping (Part 1)
Polygon clipping is an interesting problem: how do you intersect, union, or diff two polygons?
My first attempt was a failure:
Polygon Clipping - Part 1 (Greiner-Hormann)
So I researched and developed another algorithm, which handles every case:
Polygon Clipping - Part 2 (Modified F. Martinez 2008)