research-article

A Path-Based Distance for Street Map Comparison

Authors:

Brittany Terese Fasy,

Kyle S. Hickmann,

Carola WenkAuthors Info & Claims

ACM Transactions on Spatial Algorithms and Systems (TSAS), Volume 1, Issue 1

Article No.: 3, Pages 1 - 28

https://doi.org/10.1145/2729977

Published: 29 July 2015 Publication History

Abstract

Comparing two geometric graphs embedded in space is important in the field of transportation network analysis. Given street maps of the same city collected from different sources, researchers often need to know how and where they differ. However, the majority of current graph comparison algorithms are based on structural properties of graphs, such as their degree distribution or their local connectivity properties, and do not consider their spatial embedding. This ignores a key property of road networks since the similarity of travel over two road networks is intimately tied to the specific spatial embedding. Likewise, many current algorithms specific to street map comparison either do not provide quality guarantees or focus on spatial embeddings only.

Motivated by road network comparison, we propose a new path-based distance measure between two planar geometric graphs that is based on comparing sets of travel paths generated over the graphs. Surprisingly, we are able to show that using paths of bounded link-length, we can capture global structural and spatial differences between the graphs.

We show how to utilize our distance measure as a local signature in order to identify and visualize portions of high similarity in the maps. Finally, we present an experimental evaluation of our distance measure and its local signature on street map data from Berlin, Germany and Athens, Greece.

References

[1]

Mridul Aanjaneya, Frederic Chazal, Daniel Chen, Marc Glisse, Leonidas J. Guibas, and Dmitriy Morozov. 2011. Metric graph reconstruction from noisy data. In Proceedings of the ACM Symposium on Computational Geometry. 37--46.

Digital Library

[2]

Mahmuda Ahmed, Brittany Terese Fasy, and Carola Wenk. 2014a. Local persistent homology based distance between maps. In Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 43--52.

Digital Library

[3]

Mahmuda Ahmed, Sophia Karagiorgou, Dieter Pfoser, and Carola Wenk. 2014b. A Comparison and Evaluation of Map Construction Algorithms. Geoinformatica 19, 3, 601--632.

Digital Library

[4]

Mahmuda Ahmed and Carola Wenk. 2012. Constructing street networks from GPS trajectories. In Proceedings of the European Symposium on Algorithms. 60--71.

Digital Library

[5]

Helmut Alt, Alon Efrat, Günter Rote, and Carola Wenk. 2003. Matching planar maps. Journal of Algorithms 49, 262--283.

Digital Library

[6]

Helmut Alt and Michael Godau. 1995. Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry and Applications 5, 75--91.

[7]

A. Bharath and Sriganesh Madhvanath. 2014. Allograph modeling for online handwritten characters in devanagari using constrained stroke clustering. ACM Transactions on Asian Language Information Processing 13, 3 (2014), 12:1--12:21.

Digital Library

[8]

James Biagioni and Jakob Eriksson. 2012. Map inference in the face of noise and disparity. In Proceedings of the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 79--88.

Digital Library

[9]

Daniel Chen, Leonidas Guibas, John Hershberger, and Jian Sun. 2010. Road network reconstruction for organizing paths. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 1309--1320.

Digital Library

[10]

Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, and Fabian Stehn. 2009. Measuring the similarity of geometric graphs. In Proceedings of the 8th International Symposium on Experimental Algorithms. 101--112.

Digital Library

[11]

Donatello Conte, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2004. Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18, 3, 265--298.

[12]

David Eppstein. 1995. Subgraph isomorphism in planar graphs and related problems (SODA). SIAM, Philadelphia, PA, 632--640.

Digital Library

[13]

Xiaoyin Ge, Issam Safa, Mikhail Belkin, and Yusu Wang. 2011. Data skeletonization via Reeb graphs. In 25th Annual Conference on Neural Information Processing Systems. 837--845.

[14]

Sophia Karagiorgou and Dieter Pfoser. 2012. On vehicle tracking data-based road network generation. In Proceedings of the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 89--98.

Digital Library

[15]

Hang Joon Kim, Jong Wha Jung, and Sang Kyoon Kim. 1996. On-line Chinese character recognition using ART-based stroke classification. Pattern Recognition Letters 17, 12, 1311--1322.

Digital Library

[16]

Xuemei Liu, James Biagioni, Jakob Eriksson, Yin Wang, George Forman, and Yanmin Zhu. 2012. Mining large-scale, sparse GPS traces for map inference: Comparison of approaches. In KDD. ACM, New York, NY, 669--677.

Digital Library

[17]

Juliane Mondzech and Monika Sester. 2011. Quality analysis of OpenStreetMap data based on application needs. Cartographica 46, 115--125.

[18]

Daming Shi, Robert I. Damper, and Steve R. Gunn. 2003. Offline handwritten Chinese character recognition by radical decomposition. ACM Transactions on Asian Language Information Processing 2, 1, 27--48.

Digital Library

Cited By

Demiral EKaraş İ(2024)Python Kullanarak GPS İz Verilerinin Kümelenmesi ve Optimizasyonu: İstanbul Göztepe Kavşağı Mevkisi ÖrneğiGeomatik10.29128/geomatik.1502643Online publication date: 8-Aug-2024
https://doi.org/10.29128/geomatik.1502643
Aguilar JBuchin KBuchin MHosseini Sereshgi ESilveira RWenk C(2024)Graph Sampling for Map ComparisonACM Transactions on Spatial Algorithms and Systems10.1145/3662733Online publication date: 3-May-2024
https://doi.org/10.1145/3662733
Aguilar JBuchin KBuchin MHosseini Sereshgi ESilveira RWenk C(2024)Graph Sampling for Map ComparisonSpatial Gems, Volume 210.1145/3617291.3617293(1-16)Online publication date: 25-Jan-2024
https://dl.acm.org/doi/10.1145/3617291.3617293
Show More Cited By

Index Terms

A Path-Based Distance for Street Map Comparison
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Graph Sampling for Map Comparison
Comparing two road maps is a basic operation that arises in a variety of situations. A map comparison method that is commonly used, mainly in the context of comparing reconstructed maps to ground-truth maps, is based on graph sampling. The essential idea ...
On grids in topological graphs
SCG '09: Proceedings of the twenty-fifth annual symposium on Computational geometry

A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of subsets of the edge set, each of size k, such that every edge in one subset ...
Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)-f(v)|>=d if uv@?E(G), and |f(u)-f(v)|>=1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Spatial Algorithms and Systems

ACM Transactions on Spatial Algorithms and Systems Volume 1, Issue 1

Inaugural Issue

August 2015

116 pages

ISSN:2374-0353

EISSN:2374-0361

DOI:10.1145/2807914

Editor:
Hanan Samet
University of Maryland, College Park

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 July 2015

Accepted: 01 January 2015

Revised: 01 October 2014

Received: 01 June 2014

Published in TSAS Volume 1, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

National Science Foundation

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
376
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Demiral EKaraş İ(2024)Python Kullanarak GPS İz Verilerinin Kümelenmesi ve Optimizasyonu: İstanbul Göztepe Kavşağı Mevkisi ÖrneğiGeomatik10.29128/geomatik.1502643Online publication date: 8-Aug-2024
Aguilar JBuchin KBuchin MHosseini Sereshgi ESilveira RWenk C(2024)Graph Sampling for Map ComparisonACM Transactions on Spatial Algorithms and Systems10.1145/3662733Online publication date: 3-May-2024
Aguilar JBuchin KBuchin MHosseini Sereshgi ESilveira RWenk C(2024)Graph Sampling for Map ComparisonSpatial Gems, Volume 210.1145/3617291.3617293(1-16)Online publication date: 25-Jan-2024
Baltzer DHaunert JForsch A(2024)Visualizing the Influence of New Public Transport Infrastructure on Travel TimesVisualisierung des Einflusses neuer öffentlicher Verkehrsinfrastruktur auf ReisezeitenKN - Journal of Cartography and Geographic Information10.1007/s42489-024-00167-974:2(107-119)Online publication date: 22-Apr-2024
(2024)Spatial Gems, Volume 2undefinedOnline publication date: 25-Jan-2024
Buchin KFasy BSereshgi EWenk C(2023)On Length-Sensitive Fréchet SimilarityAlgorithms and Data Structures10.1007/978-3-031-38906-1_15(208-231)Online publication date: 28-Jul-2023
Meyur RLyman KKrishnamoorthy BHalappanavar M(2023)Structural Validation of Synthetic Power Distribution Networks Using the Multiscale Flat NormComputational Science – ICCS 202310.1007/978-3-031-36027-5_5(55-69)Online publication date: 26-Jun-2023
LI DWANG YYAMAMOTO RKAWAI YSUMIYA K(2022)A Low-Cost High-Performance Semantic and Physical Distance Calculation Method Based on ZIP CodeIEICE Transactions on Information and Systems10.1587/transinf.2021DAP0005E105.D:5(920-927)Online publication date: 1-May-2022
Ritter AWidmer FNiam JElbert POnder C(2021)Real-Time Graph Construction Algorithm for Probabilistic Predictions in Vehicular ApplicationsIEEE Transactions on Vehicular Technology10.1109/TVT.2021.307706370:6(5483-5498)Online publication date: Jun-2021
Chao PHua WMao RXu JZhou X(2020)A Survey and Quantitative Study on Map Inference Algorithms from GPS TrajectoriesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.2977034(1-1)Online publication date: 2020
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents