Dennis Luxen
|
0875c2d557
|
BREAKING CHANGE: the routing engine does not use the kd-tree anymore, but an external memory nearest neighbor grid. The memory consumption is less than half. This is a breaking change, please reprocess your .osrm files and take note that the parameter to routed have been changed!
Known Bug: There are some minor rounding errors that affect the position of start and destination node by a few feet.
|
2010-08-31 14:00:40 +00:00 |
|
Dennis Luxen
|
b3fded0725
|
Reverting change that made path unpacking impossible
|
2010-08-25 09:33:41 +00:00 |
|
Dennis Luxen
|
a9b76e8050
|
Using less RAM, Fixing a leak in ContractionCleanup.
|
2010-08-24 13:50:58 +00:00 |
|
Dennis Luxen
|
106155a97a
|
forgot debug output
|
2010-08-12 15:43:49 +00:00 |
|
Dennis Luxen
|
59abeccc3e
|
Show the number of connected components and the size of the largest one
|
2010-08-12 15:42:22 +00:00 |
|
Dennis Luxen
|
d07dd71078
|
Dense is dense and sparse is sparse
|
2010-08-07 12:25:45 +00:00 |
|
Dennis Luxen
|
051b710484
|
Use different map
|
2010-08-06 16:24:06 +00:00 |
|
Dennis Luxen
|
ec0108553f
|
removed libkdtree++ dependency.
|
2010-07-26 08:17:52 +00:00 |
|
Dennis Luxen
|
a83b790225
|
GCC 4.2 Compile fix. Code compiles with older GCC, that the default compiler on Mac OS. Only a few warnings left.
|
2010-07-24 14:05:03 +00:00 |
|
Dennis Luxen
|
72e314d1c0
|
kdtree usage simplified and dropped intermediate data structures
kdtree build-up twice at fast
int2ext node map holds iterators instead of object copies
some functions const'ed
buggy defines fixed
|
2010-07-14 16:29:18 +00:00 |
|
Dennis Luxen
|
fa5a042071
|
Queries are now handled by a static graph which means less RAM usage and faster queries.
|
2010-07-14 12:55:53 +00:00 |
|
Dennis Luxen
|
d4a64d2168
|
Initial Import.
|
2010-07-09 09:05:40 +00:00 |
|