Revision as of 16:39, 21 January 2007 edit Dilane (talk \| contribs) 691 edits →Draft Description ← Previous edit		Revision as of 11:06, 16 May 2007 edit undo 81.1.82.191 (talk) No edit summary Next edit →
Line 25: Points on the edge of the polygon may be considered as both in and out until their status can be confirmed after the intersections have been found and verified, however this increases the complexity. ==See Also== *[[Sutherland-Hodgman]] clipping algorithm == References ==

Weiler–Atherton clipping algorithm: Difference between revisions