Sign in to follow this  

pathfinding on Earth surface

This topic is 1296 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts



I am looking for an implementation in C++ of a (fast) algorithm for computing a visibility graph. I have been looking around but couldn't find anything satisfactory. Any tips would be much appreciated. Some context below.


Many thanks,




I have posted a similar question previously:

(many thanks for the answers).

Based on that, I thought that probably the best solution would be to use polygons of the Earth's land masses, then create a visibility graph (just once), then include origin and destination in the visibility graph, then run A*.

Share this post

Link to post
Share on other sites
Sign in to follow this