Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 05:48, 30 March 2017

Revision as of 03:01, 28 September 2018

Line 9:

* Candidate polygons need to be oriented clockwise.

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

* The algorithm can support holesoles (as countercter-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 algorithm.

== The Algorithm ==