Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 19:23, 23 July 2015

Revision as of 19:24, 23 July 2015

Line 19:

The list entries are labelled as either inside or outside the other polygon.

All the polygon intersections are then found and are inserted into both lists, linking the lists at the intersections. Care will be needed where the polygandidate ons share an edge.

If there are no intersections then one of three situations exist:

Line 35:

== Conclusion ==

Various strategies can be used to improve the speed of this labeling, and to avoid needing to proceed further. Care will be needed where the polygons share an edge.

==See also==