On Mon, Nov 18, 2013 at 12:20:44PM -0500, Stephen Woodbridge wrote:
> Flo,
> 
> pgRouting has a function to node a network of lines. It basically
> does exactly this.
> 
> It takes a table of linestring geometries, chops all the strings at
> the intersection and forms a correctly "noded" result in a new
> table, maintaining a back reference to the original table so you can
> move any attributes over to the new table.
> 
> https://github.com/pgRouting/pgrouting/blob/master/src/common/sql/pgrouting_node_network.sql
> 
> Let me know if you want to try this and need help getting started.

I solved it already much quicker - Breaking down routes in segments
who show up multiple times.

But to make the long story short - now breaks my graph selection
algorithm ;) Some assumptions don't hold up finding the best graph now.

So back to the drawing board :)

Flo
-- 
Florian Lohoff                                                 [email protected]

Attachment: signature.asc
Description: Digital signature

_______________________________________________
OSRM-talk mailing list
[email protected]
https://lists.openstreetmap.org/listinfo/osrm-talk

Reply via email to