Matching planar maps

Authors:
Helmut Alt;Alon Efrat;Günter Rote;Carola Wenk
Affiliations:
Freie Universität Berlin, Insitut für Informatik, Berlin, Germany;University of Arizona, Tucson, AZ;Freie Universität Berlin, Insitut für Informatik, Berlin, Germany;University of Arizona, Tucson, AZ
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 3
Cited 10

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)

Finding a curve in a map

Proceedings of the nineteenth annual symposium on Computational geometry
On map matching of wireless positioning data: a selective look-ahead approach

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Probabilistic range queries for uncertain trajectories on road networks

Proceedings of the 14th International Conference on Extending Database Technology
Routing-based map matching for extracting routes from GPS trajectories

Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications
Finding the most accessible locations: reverse path nearest neighbor query in road networks

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
EnAcq: energy-efficient GPS trajectory data acquisition based on improved map matching

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
PNN query processing on compressed trajectories

Geoinformatica
Fréchet-Distance on road networks

CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
User oriented trajectory search for trip recommendation

Proceedings of the 15th International Conference on Extending Database Technology
Finding traffic-aware fastest paths in spatial networks

SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc. More precisely, we will define feasible distance measures that reflect how close a given pattern H is to some part of a larger pattern G. These distance measures are generalizations of the well known Fréchet distance for curves. We will first give an efficient algorithm for the case that H is a polygonal curve and G is a geometric graph. Then, slightly relaxing the definition of distance measure we will give an algorithm for the general case where both, H and G, are geometric graphs.