Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 20:12, 23 July 2015

Revision as of 21:10, 23 July 2015

Line 26:

# A and B do not overlap – return None for clipping or A & B for merging.

Then A list of inbound intersections is then generated. Each

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

== Conclusion ==