Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 19:15, 23 July 2015

Revision as of 19:20, 23 July 2015

Line 17:

First, two lists are created where one list contains the vertices of the clipping polygon A and the another list contains the vertices of the subject polygon B.

The list entries are labelled as either inside or outside the other polygon. Various strategies can be used to improve the speed of this labelling, and to avoid needing to proceed further.

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.