1 / 18

Generalization of a routing map

Generalization of a routing map. Kirill “Zkir” Bondarenko SotM Baltic, 2013. Routing between streets. Routing between countries. OSRM:. What we need on PNA. Limited set of roads Simplified geometry Why: Mobile devices (PNA), even today, have much more weak hardware than OSRM server.

alika
Download Presentation

Generalization of a routing map

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Generalization of a routing map Kirill “Zkir” BondarenkoSotM Baltic, 2013

  2. Routing between streets

  3. Routing between countries • OSRM:

  4. What we need on PNA • Limited set of roads • Simplified geometry Why: • Mobile devices (PNA), even today, have much more weak hardware than OSRM server.

  5. Classification by road significance • For Russia, it’s just possible to select roads by highway tag (trunk, primary a secondary) • 2000+ km by trunks only

  6. Road classification in European countries? • highway = trunk in Poland

  7. European Routes Exx • Ref = E xx • Int_ref=E xx • Relation • network=e-road Hand-drawn schema from Wikipedia

  8. European Routes Exx

  9. Still too much details

  10. Before and after

  11. Still routable!

  12. This algorithm has been developed by Russian community Authors: • OverQuantum • FreeExec (java port) Two Implementations: • VB6 • Java Source code available on Github

  13. Problems: “islands” and “missing edges”

  14. Conclusions • We can select linked subset of roads • There are still some problems with connectivity • We have developed algorithm of routing graph simplification • Junctions are transformed to nodes • Two carriageway roads are converted to one carriageway roads This algorithm allows us to produce lightweight routable overview maps

More Related