Shortest path problems are a well-studied class of problems in theoretical computer science. One particularly applicable type of shortest path problem is to find the geodesic shortest path on a terrain. This type of algorithm finds the shortest path between two points that stays on the surface of a terrain. The most popular methods for finding such a shortest path involve a variant of Dijkstra’...