OJ Board

Hi

I'm implementing Weiler-Atherton's algorithm for boolean operations on concave polygons and I have a hard time dealing with the special cases. Does anyone have some knowledge on how to handle intersecting parallel edges, and stuff like that. Currently I knot how to deal with vertices which lie on edges and coincident vertices, but other special cases are still a mistery to me.

Petko

Where can we read about this algorithm ?

Do you need it for some particular problems here
at this site or for some other purpose ?

Sedefcho wrote:Where can we read about this algorithm ?

Do you need it for some particular problems here
at this site or for some other purpose ?

Just Google for it, you should be able to find it.

I don't need it for some problem here, it's part of something I am implementing.