Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 21:11, 23 July 2015

Revision as of 21:32, 23 July 2015

Line 21:

All the polygon intersections are then found and are inserted into both lists, linking the lists at the intersections.

Then Aa list of inbound intersections is generated.

Then each intersection in the list is followed clockwise around the linked lists until the start position is found.