These routines count the number of intersections among 2-D segments.
With easy changes, the routines may also return the intersection point coordinates.
Implementation of the routines is in MEX C code, so that the routines are pretty fast.
Special cases (e.g. collinear, parallel or overlapping segments) are accounted for.
Inspired by: Fast Line Segment Intersection