-
-
Notifications
You must be signed in to change notification settings - Fork 384
Edge based Graph Analysis
Stephen Woodbridge edited this page Dec 20, 2015
·
5 revisions
Here are some links that discuss modeling the edges as nodes in a graph. This is done for a variety of reasons like:
- It is easier to model turn restrictions
- it can reduce the number of node in the graph while increasing the number of edges and in general speeding up the time to compute a solution
- it has some advantages for time dependent routing
- https://algo2.iti.kit.edu/download/turn_ch.pdf
- http://lekv.de/pub/lv-turns-2008.pdf
- https://www.mapbox.com/blog/smart-directions-with-osrm-graph-model/
- http://algo2.iti.kit.edu/documents/Luxen%20Pub/sigproc-sp.pdf
- http://www.ijmo.org/vol5/480-T024.pdf
- http://www.thi.uni-hannover.de/fileadmin/forschung/arbeiten/nebesov-da.pdf