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.
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*.