Timeline for Subtract Rectangle from Polygon
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2017 at 10:31 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image links broken; now fixed.
|
| Nov 5, 2012 at 14:40 | vote | accept | Josh C. | ||
| Nov 3, 2012 at 16:11 | comment | added | Joseph O'Rourke | @Josh: You need to find all the intersection points between the four sides of your rectangle, and your polygon. Then walk around the boundary of the polygon, stopping at each intersection point, and labeling the subsegments of the polygon as in or out. Etc., where there is considerable work in "etc." This is well-explained in the literature. | |
| Nov 3, 2012 at 13:36 | comment | added | Josh C. | Once again, you give a killer answer. I've added a bit more to my op. I think this answer and my question are still inline, but I honestly can't tell. Can you explain a bit more on the complications of implementing this algorithm or the Weiler–Atherton? | |
| Nov 3, 2012 at 1:49 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 43 characters in body
|
| Nov 3, 2012 at 0:20 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |