|
-
February 5th, 2002, 12:03 PM
#1
contour of union of rectangles
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
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|