Weiler–Atherton clipping algorithm: Difference between revisions

Revision as of 01:33, 8 April 2015

Revision as of 03:00, 3 May 2015

Line 13:

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

# A is inside B -– return A for clipping, B for merging.

# B is inside A -– return B for clipping, A for merging.

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

A list of inbound intersections is then generated. Each intersection in the list is then followed clockwise around the linked lists until the start position is found. One or more concave polygons may produce more than one intersecting polygon. Convex polygons will only have one intersecting polygon.