Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’m using PostgreSQL with PostGis and have shapes of all countries loaded.
How can I calculate the shortes sea route between two ports (without intersecting a country shape)
is there a ‘standard solution’?
you could use graph theory so long as you have a set of sea-lane type way-points defined. these would be points along the ship travel lanes with maybe nautical miles between each one indicated. then use a min path algorithm to find the best travel lane.
of course inreal life this problem has many more variables than just distance i would think.