Weiler–Atherton clipping algorithm: Difference between revisions

Content deleted Content added
Jmsarazee (talk | contribs)
Jmsarazee (talk | contribs)
Line 11:
- 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.
 
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, where A is the clip region and B is the polygon to be clipped.