Dennis Luxen
|
0f1f99dbf2
|
Propagating turn info to hsgr
|
2010-10-04 11:00:36 +00:00 |
|
Dennis Luxen
|
5692d43abb
|
Propagating turn info (not yet finished)
|
2010-10-01 16:30:35 +00:00 |
|
Dennis Luxen
|
e91058c2eb
|
Output formatting
|
2010-10-01 10:30:46 +00:00 |
|
Dennis Luxen
|
5637c2f92a
|
BREAKING CHANGE, REPROCESS YOUR OSM FILES
Information if its possible at all to turn at the end of edges is propagated through the complete toolchain
|
2010-09-30 15:40:48 +00:00 |
|
Dennis Luxen
|
94cfb4aad7
|
nompute a vector<bool> that indicates if it's possible at all to take a turn at a certain node
|
2010-09-29 16:40:36 +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
|
76488c58e8
|
Preparing data structures for turn directions
|
2010-09-23 15:34:22 +00:00 |
|
Dennis Luxen
|
a07efcc4b7
|
moving common code into a single file
|
2010-09-15 13:49:26 +00:00 |
|
Dennis Luxen
|
43bbf953c1
|
Fixes bad alloc for large graphs
|
2010-09-13 15:31:29 +00:00 |
|
Dennis Luxen
|
6fcc6722c4
|
nearest neighbor grid can now be specialized to be read only with a template parameter.
|
2010-09-03 07:14:58 +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
|
cc44fef25d
|
Fix problem with long edges (ferry connections)
|
2010-09-02 09:13:59 +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
|
897f328b45
|
Disabled count of components of input graph, because its wasting too much memory.
|
2010-08-24 13:02:59 +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
|
d4a64d2168
|
Initial Import.
|
2010-07-09 09:05:40 +00:00 |
|