Generalization of a routing map Kirill “Zkir” Bondarenko SotM Baltic, 2013.

Slides:



Advertisements
Similar presentations
The Chinese Postman Problem Route Planning Map Colouring
Advertisements

UK Spatial Data into SQL Server 2008/r2 + Reporting Services Daniel Gaze & Neal Atkinson The Co-operative Group
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Graph Theory ITEC 320 Lecture 21. Graph Theory Review Higher level usage of pointers –Factories –Flyweight –Disk pool Rationale Benefits / Downsides.
A Probabilistic Model for Road Selection in Mobile Maps Thomas C. van Dijk Jan-Henrik Haunert W2GIS, 5 April 2013.
Towards Virtual Routers as a Service 6th GI/ITG KuVS Workshop on “Future Internet” November 22, 2010 Hannover Zdravko Bozakov.
Advanced Internet Application Group 6 JunHee Park, Unkyong Lee.
Intelligent Tourist Information System Author of the thesis: Krzysztof Jeleń Advisor at PWr: dr inż. Andrzej Gawrych-Żukowski Advisor at BTH: Bengt Aspvall.
Boolean Algebra Applications1 BOOLEAN ALGEBRA APPLICATIONS RELIABILITY OF CIRCUITS.
BUNI (Bluetooth Universal Navigation Interface) Design Team: Ben Doherty (Manager) Jeremy Gummeson Chris Campetti Phil Murray Faculty Advisor: Lixin Gao.
Trajectories Simplification Method for Location-Based Social Networking Services Presenter: Yu Zheng on behalf of Yukun Cheng, Kai Jiang, Xing Xie Microsoft.
PROXY FOR CONNECTIVITY We consider the k shortest edge disjoint paths between a pair of nodes and define a hyperlink, whose ‘connectivity’ is defined as:
© Honglei Miao: Presentation in Ad-Hoc Network course (19) Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks Honglei.
Hierarchical GML Modeling of Transportation Networks Knut-Erik Johnsen Veileder: Gunnar Misund.
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
Graphs Chapter 28 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
1 K. Salah Module 4.3: Repeaters, Bridges, & Switches Repeater Hub NIC Bridges Switches VLANs GbE.
Neo4j Sarvesh Nagarajan TODO: Perhaps add a picture here.
Modeling Traffic in St. Louis By Julia Greenberger.
IBM - CVUT Student Research Projects Adaptive mobile navigation Jaromír Škorpil
Properties of networks to be considered in their visualization Jan Terje Bjørke.
Authors: Jia-Wei Fang,Chin-Hsiung Hsu,and Yao-Wen Chang DAC 2007 speaker: sheng yi An Integer Linear Programming Based Routing Algorithm for Flip-Chip.
OSM and CityGuide. Quality Assurance for Navigation Software Kirill “Zkir” Bondarenko SotM Baltic, 2013.
BACK-END FOR MONITORING MESH NETWORK ACTIVITY Ajayi Olabode Oluwaseun Department of Computer Science University of the Western Cape, Private Bag x17, Bellville.
Implementation Yaodong Bi. Introduction to Implementation Purposes of Implementation – Plan the system integrations required in each iteration – Distribute.
Distributed Computing Rik Sarkar. Distributed Computing Old style: Use a computer for computation.
Mobile Navigation With SVG Christian Schmitt SVG Open 2005.
Optimum route finder to the point of interest through public transport By Pratik Mehta Submitted to Dept. Comp. Science and Engineering IIT-Bombay.
Mapping City Wide Travel Times Andrew Hardin. Project Goal Encouraging alternate transportation – NYC- Bike Share – Boulder’s Transportation Management.
11 Copyright © 2009 Juniper Networks, Inc. ANDY INGRAM VP FST PRODUCT MARKETING & BUSINESS DEVELOPMENT.
Инвестиционный паспорт Муниципального образования «Целинский район»
Gao Song 2010/02/03.  Background Knowledge  Problem Description  Framework of Solution  Own Methods  Results.
(x – 8) (x + 8) = 0 x – 8 = 0 x + 8 = x = 8 x = (x + 5) (x + 2) = 0 x + 5 = 0 x + 2 = x = - 5 x = - 2.
ArcGIS Editor for OpenStreetMap: Contributing Data Christine White.
Time Dependent Transportation Network Models Petko Bakalov, Erik Hoel, Wee-Liang Heng # Environmental Systems Research Institute (ESRI)
Embedded Circle Fitting John Daly Supervisor: Martin Glavin.
Lecture 5 CSE 331. Graphs Problem Statement Algorithm Problem Definition “Implementation” Analysis A generic tool to abstract out problems.
VuFind: Community & Code. vufind.org Overview Intro to VuFind Features & Technologies Community, Support, Sustainability …
CU-Boulder Timothy X Brown Interdisciplinary Telecommunications Electrical and Computer Engineering University of Colorado Presented to L3 Comcept at the.
How do people change their physical environment? People change their communities by building streets, bridges, homes, and other structures.
ESG-CET Meeting, Boulder, CO, April 2008 Gateway Implementation 4/30/2008.
Design and implementation of an intentional naming system William Adjie-WinotoElliot Schwartz Hari BalakrishnanJeremy Lilley MIT Laboratory for Computer.
1 Challenge the future Automatic extraction of Improved Geometrical Network Model from CityGML for Indoor Navigation Filippo Mortari.
Copyright © Curt Hill Graphs Definitions and Implementations.
IBM - ČVUT Student Research Projects Mobile Public Transportation Timetables Petr Podhorský Jakub Zahradník
Graphs Chapter 28 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. Data Structures and Abstractions with Java, 4e Frank Carrano.
India has one of the largest road networks in the world, aggregating to about 2.3 million km at present. In India, roadways have preceded railways.
Overview of Relational Markov Networks Colin Evans.
1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.
1 3/21/2016 MATH 224 – Discrete Mathematics First we determine if a graph is connected.
照片档案整理 一、照片档案的含义 二、照片档案的归档范围 三、 卷内照片的分类、组卷、排序与编号 四、填写照片档案说明 五、照片档案编目及封面、备考填写 六、数码照片整理方法 七、照片档案的保管与保护.
공무원연금관리공단 광주지부 공무원대부등 공적연금 연계제도 공무원연금관리공단 광주지부. 공적연금 연계제도 국민연금과 직역연금 ( 공무원 / 사학 / 군인 / 별정우체국 ) 간의 연계가 이루어지지 않고 있 어 공적연금의 사각지대가 발생해 노후생활안정 달성 미흡 연계제도 시행전.
Жюль Верн ( ). Я мальчиком мечтал, читая Жюля Верна, Что тени вымысла плоть обретут для нас; Что поплывет судно громадней «Грейт Истерна»; Что.
Database and Data API. Database Different data sources: International Offices Web Design the data schema based on the data found Transform all the data.
CCNA 3 Chapter 10 Virtual Trunking Protocol
Gardening OSM data with Overpass API
Modernizing web service standards: The next version of WFS
Minimum Spanning Tree Neil Tang 3/25/2010
Chapter 9: Graphs Basic Concepts
Infrastructure Development and Trade Facilitation for LLDCs: Key issues Gladys Mutangadura Senior Programme Officer UN-OHRLLS.
What’s new in ASP.NET Core and Entity Framework 2.2 (Preview 3)
Maximum Flow Neil Tang 4/8/2008
Prim’s Minimum Spanning Tree Algorithm Neil Tang 4/1/2008
Title Introduction: Discussion & Conclusion: Methods & Results:
Amir Kouretchian Peter Turschmid Chris Byszeski
Chapter 9: Graphs Basic Concepts
ArcGIS Editor for OpenStreetMap: Contributing data
ENOG16, Tiblisi Arnold Nipper – IXPDB Admin
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
LEARNING & DEVELOPMENT STRATEGY: PROCESS OVERVIEW
Presentation transcript:

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.

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

Road classification in European countries? highway = trunk in Poland

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

European Routes Exx

Still too much details

Before and after

Still routable!

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

Problems: “islands” and “missing edges”

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