Dennis Luxen
|
17310a9d2b
|
Fixes a race condition when more than one thread tries to access the grid file (thanks Patrick)
|
2010-11-18 16:58:31 +00:00 |
|
Dennis Luxen
|
3b885a492c
|
Every node in route carries a bit that indicates if its possible at all to take a turn
|
2010-10-01 10:32:39 +00:00 |
|
Dennis Luxen
|
676f64b0ef
|
BREAKING CHANGE, REPROCESS YOUR OSM FILES
All preparations necessary to compute and output turn directions.
|
2010-09-29 15:22:38 +00:00 |
|
Dennis Luxen
|
4c47d5b70e
|
segfault if first routing node equals start node
|
2010-09-29 13:22:12 +00:00 |
|
Dennis Luxen
|
76488c58e8
|
Preparing data structures for turn directions
|
2010-09-23 15:34:22 +00:00 |
|
Dennis Luxen
|
586e8b4c4b
|
Saving a byte per node
|
2010-09-22 10:21:18 +00:00 |
|
Dennis Luxen
|
2acfe2591f
|
Fixing a rare case of route construction problems when origin were on the same edge which was stored reversed in graph.
|
2010-09-22 07:50:00 +00:00 |
|
Dennis Luxen
|
8f06b2fa31
|
It is way too late to fix silly bugs.
|
2010-09-21 17:15:59 +00:00 |
|
Dennis Luxen
|
c36fc9e49f
|
Forgot to guard against bad data from NNGrid
|
2010-09-21 16:23:50 +00:00 |
|
Dennis Luxen
|
ee56d0051f
|
Fixing odd behavior when origin and destination are on the same street.
|
2010-09-21 15:59:52 +00:00 |
|
Dennis Luxen
|
be836dc950
|
fixing last leg of output path
|
2010-09-17 08:46:43 +00:00 |
|
Dennis Luxen
|
41e5a52509
|
last leg of route is now computed correctly
|
2010-09-16 15:08:45 +00:00 |
|
Dennis Luxen
|
94c8c61a05
|
New auxiliary method
|
2010-09-14 16:40:11 +00:00 |
|
Dennis Luxen
|
1ba915cbed
|
BREAKING CHANGE, REPROCESS YOUR OSM FILES
Ferry egdes are now ignores by nearest neighbor grid
|
2010-09-02 15:47:55 +00:00 |
|
Dennis Luxen
|
e79e36bea9
|
Perfomance fixes
|
2010-09-02 13:01:49 +00:00 |
|
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
|
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
|
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 |
|