Revision as of 15:04, 28 September 2008 edit Una Smith (talk \| contribs) Pending changes reviewers 23,024 edits fix link ← Previous edit		Revision as of 10:41, 30 March 2009 edit undo 81.135.168.185 (talk) clarify last paragraph, all polygons have points on their edges, this refers to polygons which just touch. Next edit →
Line 22: Some polygon combinations may be difficult to resolve, especially when holes are allowed. Points onvery close to the edge of the other polygon may be considered as both in and out until their status can be confirmed after all the intersections have been found and verified, however this increases the complexity. ==See also==

Weiler–Atherton clipping algorithm: Difference between revisions