Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 03:25, 25 November 2009

Revision as of 10:33, 12 February 2010

Line 3:

== Description ==

The algorithm requires polygons to be clockwise and not [[Reentrant (subroutine)|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.

Two lists are created from the coordinates of each polygons A and B.