the jittering algorithm appears to fail in 0.1% of all cases
I'll try to find a better way
I implemented this polygon clipping algorithm
http://en.wikipedia....pping_algorithm
here you can see it working
[media]
[/media]
solving degenerate cases is very troublesome though
at first I tried to handle every degenerate case properly but it seems to be very hard to impossible
since I don't need 1000% accuracy (I am fine with up to 0.5 pixel of jittering) I decided to randomly move polygon points until all degenerate cases are gone but I must have overlooked something
I am trying to get this to work since months so I decided to ask for help
the algorithm is supposed to subtract a polygon from another polygon and returns a list of polygons as a result of this subtraction
how it works:
1. create linked lists of vertices from both polygons
2. randomly move vertices until they are not on top of any lines
3. calculate all intersection points twice (once for each polygon) and connect them
4. insert intersection points into linked list of vertices
5. start at any intersection point and move through the linked list, swap list if another intersection point is reached
is there any easier way to deal with degenerate cases?
sidenote: I also tried java topology suite but for some reason it is a few tenthousand times slower (no exaggeration)
