Tagged Questions
6
votes
2answers
111 views
Algorithms for optimally locating points
I am trying to compare locations of where several thousand facilities have been actually built to where they would be optimally located to minimize travel times of the population (represented by ...
10
votes
1answer
227 views
Are there any intelligent travelling salesmen?
Jokes aside, I have had a routing problem that is almost a travelling salesman problem (TSP):
the starting point is defined
the end point coincides with the starting point
each node has to be ...
8
votes
0answers
54 views
Alternative indexing methods for point set operations
It is common to use a bounding box spatial index to improve performance when working with a large number of features. Where operations are performed against individual geometries with a large number ...
6
votes
1answer
155 views
Optimize GEOSGeometry's spatial operations by avoiding thread-safety checks
A ranking algorithm I'm developing for a Django webapp requires performing spatial operations (within, intersections, sym_difference, etc.) using a query against large number of geometry objects.
...
31
votes
3answers
4k views
Are there newer routing algorithms (than Dijkstra, A*) in GIS databases?
There are works like Reach for A* from Microsoft researchers and Highway Hierarchies by Sanders and Schtolz (if I spell the name correctly) from Karlsruhe Uni. Both of them reduce the calculations ...
