Hi Jukka, Interesting question. There has been so much research works about generalization that it is surely not a simple task. I have tested the following approach with mitigated results : - make the layer planar with the noder plugin - detect small cycles with the graph plugin - merge adjacent cycles - create a point inside each cycles surface - remove network segments along these cycles (query + DE-9IM) - detect roads touching the cycles - project the center points of cycles to the road endpoints ==> replace small roundabout by simple nodes
Possible improvements (probably need a dedicated plugin) - make it work on non planar graph (or just remove bridges/tunnels from the graph) - replace small edges between two nodes with degree 3+ by a single node, not only small cycles - process iteratively starting with smallest edges/cycles Michaël > Hi, > > See this: > http://gis.stackexchange.com/questions/12370/how-to-simplify-a-routable-network > > I had a quick try with "noder" and "remove microsegments" tools but the > result was not very good. > > -Jukka- > > ------------------------------------------------------------------------------ > Time is money. Stop wasting it! Get your web API in 5 minutes. > www.restlet.com/download > http://p.sf.net/sfu/restlet > _______________________________________________ > Jump-pilot-devel mailing list > Jump-pilot-devel@lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/jump-pilot-devel > ------------------------------------------------------------------------------ Time is money. Stop wasting it! Get your web API in 5 minutes. www.restlet.com/download http://p.sf.net/sfu/restlet _______________________________________________ Jump-pilot-devel mailing list Jump-pilot-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/jump-pilot-devel
