Re: [Algorithms] Special cases of Weiler-Atherton

[Andrzej B. <bor...@gm...>]

Yes, I saw this.
And algorithm Greiner-Hormann is similar to this. In base version not
handles special cases, but is extension to special case by Foster and
Overleft. This extension requires computing if point is inside or outside
neighbor polygon. Fortunately is not need computing it for all vertices,
only for first, and vertices which meet intersections points
I don't know which if faster - Greiner-Hormann with special cases or Vatti?