Hi
I am trying to obtain the union or difference of a concave polygon(without holes) and a rectangle where the rectangle can intersect with the polygon at most at 2 points.Do you know any efficient algorithms for that purpose?( since I have only been able to triangulate the concave polygon )
Thanks