I took the liberty of comparing the result on that page to the direct
call. How realistic are the results?
If I run a route e.g. from Heroldsberg to Biograd, I get greatly different
times:
http://apmon.dev.openstreetmap.org/routing: 9,5s
directly on http://graphhopper.com/maps/: 0.017s
Hi
Am 24.07.2013 06:52, schrieb Kai Krueger:
I was curious to see how it compares in speed and quality of calculated
routes to the other engines, so I took the liberty to add it to
http://apmon.dev.openstreetmap.org/routing
It seems the labeling is wrong. When using the Grasshopper Router it
Peter Körner wrote
Hi
Am 24.07.2013 06:52, schrieb Kai Krueger:
I was curious to see how it compares in speed and quality of calculated
routes to the other engines, so I took the liberty to add it to
http://apmon.dev.openstreetmap.org/routing
It seems the labeling is wrong. When using
Hi there,
yesterday we released the first public version of our fast and Open
Source routing engine called GraphHopper. This could be especially
interesting for Java developers. You can also try our web application
http://graphhopper.com/maps/ with world wide coverage. See the full
anouncement
Hi Peter,
Nice to see new stuff. Works nice in long distances.
I noticed that it does not like roads with tram rails. (highway=*,
railway=tram)
See
http://graphhopper.com/maps/?point=56.949977%2C24.120226point=56.952645%2C24.122061
Viesturs
On Tue, Jul 23, 2013 at 10:22 AM, Peter K
Thanks! I've created an issue for it!
Peter.
Hi Peter,
Nice to see new stuff. Works nice in long distances.
I noticed that it does not like roads with tram rails. (highway=*,
railway=tram)
See
http://graphhopper.com/maps/?point=56.949977%2C24.120226point=56.952645%2C24.122061
Hi,
Here's some feedback:
1. It seems turn restrictions are not taken into account in the routing?
2. It seems that the internal routing graph has too few nodes from where
you can start or end. I think this might be a result of the optimizations
you have performed to make the router fast. So if
Hi Eugene,
thanks for your feedback!
1. It seems turn restrictions are not taken into account in the routing?
yes
2. It seems that the internal routing graph has too few nodes from
where you can start or end. I think this might be a result of the
optimizations you have performed to make
On 23.07.2013 09:22, Peter K wrote:
yesterday we released the first public version of our fast and Open
Source routing engine called GraphHopper.
I'm curious which of the more tricky features of the OSM data model are
already supported by GraphHopper. You commented on turn restrictions,
but
Hi,
On 23.07.2013 09:22, Peter K wrote:
yesterday we released the first public version of our fast and Open
Source routing engine called GraphHopper.
I'd like to understand better where this fits in between the purely A*
gosmore and the CH-based osrm.
With osrm, it is difficult to have
Hi Frederik,
I read that I can run GraphHopper with or without CH.
this is true. Currently you have the choice between A*/Dijkstra (simple,
bidirectional, bidirectional CH)
or is the speed profile baked into the routing graph
The online demo is CH based and requires 3*16GB. If you'd use a
The online demo is CH based and requires 3*16GB
Forgot to mention that if one would reuse the base graph of ~9GB one
could reduce this to something like 25GB (would take a bit development
effort)
Peter.
___
dev mailing list
dev@openstreetmap.org
Hi,
this looks like an interesting addition to the set of routing engines
already available for OSM data.
I was curious to see how it compares in speed and quality of calculated
routes to the other engines, so I took the liberty to add it to
http://apmon.dev.openstreetmap.org/routing
That page
Kai Krueger wrote
I was curious to see how it compares in speed and quality of calculated
routes to the other engines, so I took the liberty to add it to
http://apmon.dev.openstreetmap.org/routing
I took the liberty of comparing the result on that page to the direct call.
How realistic are the
NopMap wrote
Kai Krueger wrote
I was curious to see how it compares in speed and quality of calculated
routes to the other engines, so I took the liberty to add it to
http://apmon.dev.openstreetmap.org/routing
I took the liberty of comparing the result on that page to the direct
call. How
Thanks!
Hi,
this looks like an interesting addition to the set of routing engines
already available for OSM data.
I was curious to see how it compares in speed and quality of calculated
routes to the other engines, so I took the liberty to add it to
16 matches
Mail list logo