Polygon Clipping (Part 1 & 2)
Polygon clipping is an interesting problem: how do you intersect, union, or diff two polygons?
The Greiner-Hormann clipping algorithm is quite beautiful and intuitive. However the Greiner-Hormann clipping algorithm cannot deal with coincident lines. This turns out to be a huge pain – so there is part 2 that works for all polygons.
https://sean.cm/a/polygon-clipping-pt1
https://sean.cm/a/polygon-clipping-pt2
#polygonclipping #clipping
Post #1670
90
- 👍 2