We need to find a way to calculate the coordinates for a line in a map system using latitude & longitude with obstacles.
For example a line will travel from: +2, +2 to -20,-20.
There will however be a point that the line cannot travel through and must travel above/below the area:
So the coordinates above would make a square, that is "locked" and the line traveling to -20,-20 must the find another way to reach its goal.
There can however be more than 1 obstacle, and the line must always find the shortest path to its goal without hitting any obstacles in the way.