think there is something wrong in the common toolchain (?). I would
prefer to use mirros to take off load from the main servers and have
more local ones.
Kind Regards,
Peter.
--
GraphHopper.com - Fast Flexible Road Routing
On 20.10.2014 01:55, Paul Norman wrote:
On 10/19/2014 3:04 PM, Peter
Hi there,
it looks like all pbf export servers I know have no recent or corrupt
pbf exports (small file size of 17gb or 6gb instead of 27gb):
http://wiki.openstreetmap.org/wiki/Planet.osm
Is this a known issue of some export tool? Or do you know an alternative?
(Also it looks like there are no
Osmosis just uses this library, right?
I mean, it is a nicely packaged version of LGPLed OSM-binary:
https://github.com/openstreetmap/osmosis/tree/master/osmosis-osm-binary
Use it in maven via:
dependency
groupIdorg.openstreetmap.osmosis/groupId
You could spread the word so that there will be more OSM projects
available for gsoc ;)
https://wiki.openstreetmap.org/wiki/Google_Summer_of_Code/2014/Project_Ideas
Regards,
Peter.
Hello all,
I am a MS by research student(Computer Science) at Lab for Spatial
Informatics, International
Hi there,
yesterday we released the second public version of our fast and Open
Source routing engine called GraphHopper in 100% Java. You can also try
our web application http://graphhopper.com/maps/ with world wide
coverage. See the full anouncement here.
fledged sql parser.
I ended up with this as the entry point:
https://github.com/yvecai/RenderLegend/blob/master/legend_compact.xml
This kind of file should probably come in 2 version: a short one and a
to-be-complete one.
Hope this helps,
Yves
On 09/16/2013 11:55 AM, Peter K wrote:
Hi
Hi,
is there a kind of a standard or suggestion on how to retrieve the map
key? Like an http API or a leaflet plugin? On osm.org there is only the
'map key' data available for the default layer in the right box. And not
all details are given like here:
, schrieb Peter K:
Hi,
is there a kind of a standard or suggestion on how to retrieve the map
key? Like an http API or a leaflet plugin? On osm.org there is only the
'map key' data available for the default layer in the right box. And not
all details are given like here:
http
Hi there,
I know that this is highly subjective: But why has the default map style
to be that ugly? I don't mean it as a rant, I know how difficult it is
to create something like this. I only say that it is 'ugly' because I
know there are a lot better and several alternatives.
What do I mean
Hi Andy, hi Frederik, hi Maarten,
I know that this is highly subjective: But why has the default map
style to be that ugly? I don't mean it as a rant, I know how difficult
it is to create something like this. I only say that it is 'ugly'
because I know there are a lot better and several
Am 28.08.2013 17:33, schrieb Andy Allan:
On 28 August 2013 16:26, Holger Jeromin mailgm...@katur.de wrote:
I think the rewrite in carto wanted to maintain the visual result to be
sure to be able to switch the main rendering. Otherwise the switch could
be stopped by some for visual reasons.
As there are redirects I do not see an issue here and I really like the
progress which is going on!
... why not introduce a policy how to make changes to osm.org to avoid
'social' or other issues in the future?
I would suggest instead of discussion everything on the dev mailing
list, do it like
Although I do very much hope that something like this will eventually
make its way onto osm.org. Kai
I've created an issue for it:
https://github.com/openstreetmap/openstreetmap-website/issues/381
___
dev mailing list
dev@openstreetmap.org
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 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
Viesturs
On Tue, Jul 23, 2013 at 10:22 AM, Peter K peat...@yahoo.de
mailto:peat...@yahoo.de wrote:
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
-way street.
Eugene
On Tue, Jul 23, 2013 at 3:22 PM, Peter K peat...@yahoo.de
mailto:peat...@yahoo.de wrote:
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 Android and you won't need
lots of RAM which could be want you want for the CH-based stuff and
multiple profiles. But of course this will slow things down too, but I
don't know how much (will still depend on how many RAM is available).
Regards,
Peter.
Hi,
On 23.07.2013 09:22, Peter K wrote
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
.
I hope adding it was OK with you. If not, then I will of cause remove it
again immediately. But given that that demo page produces pretty much no
traffic and graphhopper seems pretty fast, I thought it wouldn't cause
any issues.
Kai
On 07/23/2013 01:22 AM, Peter K wrote:
Hi
Hey Martin,
without giving us an example of your exact problem we can just say: for
us this would work...
IMO your step by step approach is not sufficient to work properly.
You'll need a the driver's final destination and full path.
Why? Assume a route A-B-C (where B would have a traffic light)
Hi Martin,
Also here in my city (Germany) several junctions have a separate lane
for turning right.
And this lane has no traffic light, but the junction has one!
you got it.
and i can't solve it without a defined junction.
All the examples I mean are properly defined (Ie. only if you
Hi Martin(s),
All the examples I mean are properly defined (Ie. only if you really
cross the junction you'll pass a traffic signal, turning right is mapped
as a separate lane without traffic light).
So give us the concrete example you mean.
but of course there are also situations without
Martin,
routing is not enough
Why not? I don't see your problem. Do you have an example?
how can i import data partially and consistent?
Regarding routing: IMO this is possible when you just import the ways in
your current boundary (and all of the involved nodes).
one junction = one
24 matches
Mail list logo
