772 reputation
1622
bio website
location
age
visits member for 3 years, 4 months
seen Dec 18 at 10:05

I am currently working on a planning system for cycling, walking, sailing, etc. It is based on both a fixed network and a full OSM network. There is a web app for the planning of routes and a mobile app for the navigation of these routes.

Among others i have used the following tools: postgresql, postgis, pgrouting, QGIS, Open Jump, Google Maps, Osmdroid, leaflet.

Atm i am interested in fast routing solutions that allow me to route realtime on larger OSM datasets (>100K ways).


Jan
16
comment Is it possible to gray out a Google Maps map except for some area?
This does indeed display the functionality i am looking for! I will have to dive into the source to see if it is easily implementable in my case. They are talking about hacks (i immediately get IE7 fears).
Jan
16
asked Is it possible to gray out a Google Maps map except for some area?
Jan
12
comment Find all of the ways that intersect a linestring
I find it a bit weird to use ST_DWithin for your needs. Do you check on distance = 0?
Jan
10
awarded  Nice Question
Jan
10
comment How does pgRouting shortest_path work?
This is indeed an answer to the title. Somehow i have a feeling that he kind of knows how it works but doesn't understand why it doesn't technically work for him.
Jan
10
comment How does pgRouting shortest_path work?
Do you have a tool like QGIS? If so, load your network with that and put the layer in Edit mode. That way you see all verices and you can probably spot missing vertices. Otherwise select vertices that are only 1 time a source or target and make them visible to see where they lie. Dead ends are ok, but somewhere inside your network is probably wrong.
Jan
10
comment How does pgRouting shortest_path work?
Start with a very simple case. The simplest test would be to route from a source to target on the same edge. If that doesn't work you might not have to correct columns. If it works test a target that is on a connecting edge. If that doesn't work your edges might not be correctedly conected, etc.
Jan
6
comment Generating very simple slippy map tiles
The documentation of Mapnik says that with the option -s (slim) it should run on the amount of memory you give it. However in my experience i still get out of memory exceptions with 8GB and/or it operates so slow that i fear it isn't doing anything useful anymore.
Jan
6
comment Generating very simple slippy map tiles
To what depth are you going to generate the tiles? If you go to zoom level 18 or beyond for the entire planet you might run out of file handles. I ran into this problem for a much smaller area than the entire planet. On zoom level 18 we are already talking about 68.719.476.736 tiles and thus files (unless you are planning to generate them on the fly).
Jan
6
awarded  Organizer
Jan
6
revised Using a list of geographic locations, and determining the X closest locations to a user-defined location
Question isnt really about (the tags) google-maps or mx-excel. It seems to be about finding a proper GIS tool and shortest path algorithms
Jan
6
suggested approved edit on Using a list of geographic locations, and determining the X closest locations to a user-defined location
Jan
6
answered Using a list of geographic locations, and determining the X closest locations to a user-defined location
Jan
6
comment How to route over (partial) edges in pgrouting?
I add the temporary nodes into the sql query that does the shortest path with a join.
Jan
1
awarded  Teacher
Jan
1
comment Find all of the ways that intersect a linestring
Yes, sorry it was newyear night and i drank a lot of champagne. I could have been a little bit more elaborate.
Jan
1
answered Find all of the ways that intersect a linestring
Nov
23
comment Help choosing a suitable routing engine
It is good to hear from someone who has actually tested both systems. Meanwhile i have a lot more experience with pgrouting. I noticed that pgrouting builds the entire graph for each query and that makes it rather slow for large networks (Germany size), so i don't see why pgrouting would require less memory than Neo4j. My next try will be to get the entire graph static in ram and route on that (with neo4j, nx_spatial etc) to ensure a faster response for real time routing.
Nov
22
awarded  Enthusiast
Nov
18
accepted How can I optimize pgrouting for speed?