Weiler–Atherton clipping algorithm: Difference between revisions

Content deleted Content added
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. Then, merging of polygons can be performed by a variant of the algorithm.