Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 10:52, 8 December 2020

Latest revision as of 05:51, 4 July 2023

(One intermediate revision by one other user not shown)

Line 1:

{{Short description|Polygon clipping algorithm}}

The '''Weiler–Atherton''' is a polygon-[[Clipping (computer graphics)|clipping]] [[algorithm]]. It is used in areas like [[computer graphics]] and games development where clipping of polygons is needed. It allows clipping of a ''subject or candidate polygon'' by an arbitrarily shaped ''clipping polygon/area/region''.

Line 9 ⟶ 10:

* 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 polygorithmpolygon), 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.

== Algorithm ==