Updated on 13/06/2005

I am trying to implement the Weiler Atherton algorithm (You can find the original article here: Weiler Atherton)

The algorithm works well for the general case.
The general case is when intersection points are not on polygon edges (fig 1).


When have then to distinguish two main different non trivial cases

So ??? what's next ?

The algorithm works and now i get some errors from .... floating point precisions issues... and that's another story i guess...