Revision as of 06:38, 3 June 2011 edit Theo10011 (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 3,684 edits m Reverted edits by 183.182.87.194 (talk) to last revision by FrescoBot (HG) ← Previous edit		Revision as of 09:28, 7 June 2011 edit undo Timotei21 (talk \| contribs) 6 edits Add image from the German Page Next edit →
Line 3: == Description == [[Datei:Weiler-Atherton subdivision.svg\|thumb\|upright=1.2\|Subdivision with the Weiler-Atherton algorithm]] The algorithm requires polygons to be clockwise and not reentrant (self intersecting). The algorithm can support holes (as counter-clockwise polygons wholly inside their parent polygon), but requires additional algorithms to decide which polygons are holes. Merging of polygons can also be performed by a variant of the algorithm.

Weiler–Atherton clipping algorithm: Difference between revisions