Tag Info

Hot answers tagged

1

As well as Floyd-Warshall, for all-pairs routing, you could consider Johnson's algorithm. An alternative to running Dijkstra for each intersection could be to run A* as the latter is usually considered to be faster. I recommend you have a look at PgRouting, which is a plugin to PostGIS. It would be straightforward enough to import your data to PostGIS. ...


1

The first comment about merging points to lines will get you to the closest road, but this will not take into account the terrain cost (ie going through a forest or up a mountain may be a shorter distance but will take much longer than a longer distance but easier travelled clear route) To do this like the comment said it is simply a euclidian distance trig ...



Only top voted, non community-wiki answers of a minimum length are eligible