Home Forums HCL Reviews Tutorials Articles Register Search Today's Posts Mark Forums Read
 LinuxQuestions.org [SOLVED] Algorithm for finding the shortest path between Geocoordinates
 Programming This forum is for all programming questions. The question does not have to be directly related to Linux and any language is fair game.

Notices

 06-27-2011, 02:00 AM #1 TheIndependentAquarius Senior Member   Registered: Dec 2008 Posts: 4,646 Blog Entries: 29 Rep: Algorithm for finding the shortest path between Geocoordinates AStar works on the basis of straight lines, AFAIK. In my case, we have geocoordinates and I can get the straight line distance between the waypoints. But I am wondering how approximate will the route calculated on this basis be? The actual distance "by road", which actually matters can be different. Example. Assuming A and B are on the same plane, and will be equidistant from the goal point, if we consider a straight line between A and the goal point and, B and the goal point. The distance "by road" between A and the goal point may be greater or lesser than B. But because the AStar works on the basis of straight lines, it will return both the routes as the shortest. Is that correct? If yes, then which algo should be considered , if we want the results on the basis of actual distance in Km/m? If no, then what's the point that I am missing? P.S Haven't yet studied AStar is extreme depths.
 06-27-2011, 03:37 AM #2 TheIndependentAquarius Senior Member   Registered: Dec 2008 Posts: 4,646 Blog Entries: 29 Original Poster Rep: Alright, people helped me here: http://stackoverflow.com/questions/6...geocoordinates Marking this solved.