0
$\begingroup$

I'm looking for an efficient way to determine if two paths (sets of x,y coordinates) intersect at a point.

Input - (x,y) from a Mercator Projection (longitude,latitude) coordinates

Output - Intersection point

I looked at this question here: Solve for the intersection point, given two sets of data but there doesn't seem to be an answer.

Does anyone have any suggestions on where to start?

1 Answers 1