Hi,
I have been working on a project that has to find a route between 2 points
using algorithms like Dijkstra or A*.
The project is working, however, the processing time since the
destination/source insertion and the retrieval of the route its a bit too
much: 8s and i have to reduce it to max 2s.
Now, the graph that is created based on a shapefile is pretty huge. After
running tests, by cutting the shapefile, and thus reducing the graph, i
figured out i can get results in less than 1s which is awesome.
So for that i need a dynamic fast way to select a certain part of the graph
like a bounding box with the 2 points as parameters and run the algorithm
in it.
Is there something that you could recommend? I did try to process the
shapefile by cutting it with ogr2ogr but that takes some time also so it is
not a solution for me.
------------------------------------------------------------------------------
Open source business process management suite built on Java and Eclipse
Turn processes into business applications with Bonita BPM Community Edition
Quickly connect people, data, and systems into organized workflows
Winner of BOSSIE, CODIE, OW2 and Gartner awards
http://p.sf.net/sfu/Bonitasoft
_______________________________________________
GeoTools-GT2-Users mailing list
GeoTools-GT2-Users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/geotools-gt2-users
