Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 11:34, 9 May 2006

Revision as of 07:47, 29 June 2006

Line 10:

Requires polygons to be clockwise and not re-enterant (self intersecting)

The algorithm can support holes (as counter-clockwise polygons wholly inside thertheir 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.