Fix clipping logic when dealing with overlapping segments.

v1.0.3

Fix calculation of "inout" fields for overlapping segments (#12) (#13)

v1.0.2

• Added Polygon.MakeValid()
• Restored previously removed Bug3 tests now that self-intersections can be healed

v1.0.1

Fixes to handle edge cases found by testing operations on large circles with infinitesimal intersections.

• Sweep algorithm fixed to also resweep endpoints that divide the next segment (not just the previous) in the sweep line.
• Snap algorithm improved avoid snapping when possible, and snap to an middle endpoint when there is more than one candidate.
• Intersection tolerance tuned to eliminate false positives.

Initial release

Forked from akavel/polyclip-go with the following fixes:

• Fixed findIntersection() implementation for overlapping segments.
• Fixed sweep algorithm to revisit segments that divide previous segments.
• Added resistance to polygon corruption that arises from floating point imprecision.
• Prevent infinite recursion by rejecting non-reductive segment divisions.