Find the intersection of two segments. A more robust approach that uses predicates to ensure no
false positives/negatives
NOTE:
If the segments are touching at end points, they PASS in this function. However, the caviat is
that if the segments are coming from the same ring, then the result will be undefined (not
considered an intersection).
NOTE: The resultant vectors are displacement vectors not normalized.
Find the intersection of two segments. A more robust approach that uses predicates to ensure no false positives/negatives
NOTE: If the segments are touching at end points, they PASS in this function. However, the caviat is that if the segments are coming from the same ring, then the result will be undefined (not considered an intersection).
NOTE: The resultant vectors are displacement vectors not normalized.