|
Posted by jimirwin on December 31, 2005, 9:29 am
Please log in for more thread options
@z14g2000cwz.googlegroups.com:
> hi,
>
> i am working on a routing module of a navigation system on pocket pc.I
> found Dijkstra algorithm the best for calculating the shortest path
> between two nodes (start and end points).Since pocket pc has a limited
> memory space and graph size may go to n size depending upon the
> geographical boundary i am considering.So i need to restrict the data
> section from the start to the end point so that graph size would become
> smaller and can be accomodated in the available memory .In a way i need
> to extract a smaller graph logically from a bigger graph based upon
> start and end points so that the scope of the computation is limited.
Could you consider pruning the nodes based on some form of quadtree or
other spatial index structure, to limit the graph to the nodes that lie
within some corridor between and around your start and end points?
--
Jim Irwin
http://www.holoscenes.com
| 
XML Sitemap