Content deleted Content added
Line 20:
All the polygon intersections are then found and are inserted into both lists, linking the lists at the intersections.
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.▼
Then A 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.
▲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.
== Conclusion ==
| |||