Hi,
I need to find the contour/outline/polygon of the union of n rectangles. (For Visual C++ programmers: turn a CRgn into a poly-polygon.) I searched the internet and found some references to 'plane-sweep' algorithms, but I couldn't find any C++ or high-level description of the algorithm.
Can anybody help me here?
Martin
