[OSM-dev] Simplifying data for routing

[flo detig]

> > Since I'm dropping most of the OSM nodes, I'm thinking that the  
> > vertices on the graph should be intersections. 
> > describe nearby intersections in terms of how many "ways" they   

> ...on the whole, A* is preferred for routing.
> 
> I believe there are some routing functions available for PostGIS (google 
> for "pgRouting"); 


Hi,
my name is flo - I'm newbie but very happy / eager to see you discussing this
stuff :)

this is what I tried:
- rails port
- postgis
- http://pgrouting.postlbs.org
  (implemented in c with boost graph lib -> very fast)
- google maps

screenshots of results (compared to routing via googlemaps api):
http://www.flickr.com/photos/detig/


I used a ruby-script to build network-graph-topology appropriate for routing
- created two new tables (edges, vertices) required by pgrouting
- removed all vertices (nodes between way-segments) with degree less than three
(non-intersections)
  (took one and a half hours just for the city of munich)

anybody interested?
Can I commit the code?