Jump to content

View more

View more

Image of the Day

雑魚は多めにして、爽快感重視にしつつ・・・(´・ω・`)
早いとこ、ベースを作って、完成にもっていかないとね。
タイトルもまだ迷ってるだよなぁ。 
#indiedev  #indiegame #screenshotsaturday https://t.co/IwVbswGrhe
IOTD | Top Screenshots

The latest, straight to your Inbox.

Subscribe to GameDev.net Direct to receive the latest updates and exclusive content.


Sign up now

pathfinding on Earth surface

4: Adsense

Old topic!

Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.


  • You cannot reply to this topic
No replies to this topic

#1 laetitia88   Members   

108
Like
0Likes
Like

Posted 01 July 2014 - 11:21 AM

Hi,

 

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,

Laetitia

 

context:

I have posted a similar question previously:

http://www.gamedev.net/topic/647633-pathfinding-on-7-oceans/

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






Old topic!

Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.