Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 07:33, 3 January 2019

Revision as of 10:52, 8 December 2020

Line 9:

* Candidate polygons need to be oriented clockwise.

* Candidate polygons should not be self-intersecting (i.e., re-entrant).

* The algorithm can support holes (as counter-clockwise polygons wholly inside their parent polygon), but requires additional algorithms to decide which polygons are holes, after which merging of the polygons can be performed using a variant of the algorithmpolygorithm.

== Algorithm ==