Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance
Article No.: 14, Pages 1 - 33
Abstract
Map matching is a common preprocessing step for analysing vehicle trajectories. In the theory community, the most popular approach for map matching is to compute a path on the road network that is the most spatially similar to the trajectory, where spatial similarity is measured using the Fréchet distance. A shortcoming of existing map matching algorithms under the Fréchet distance is that every time a trajectory is matched, the entire road network needs to be reprocessed from scratch. An open problem is whether one can preprocess the road network into a data structure, so that map matching queries can be answered in sublinear time.
In this article, we investigate map matching queries under the Fréchet distance. We provide a negative result for geometric planar graphs. We show that, unless SETH fails, there is no data structure that can be constructed in polynomial time that answers map matching queries in O((pq)1-δ) query time for any δ > 0, where p and q are the complexities of the geometric planar graph and the query trajectory, respectively. We provide a positive result for realistic input graphs, which we regard as the main result of this article. We show that for c-packed graphs, one can construct a data structure of \(\tilde{O}(cp)\) size that can answer (1+ε)-approximate map matching queries in \(\tilde{O}(c^4 q \log ^4 p)\) time, where \(\tilde{O}(\cdot)\) hides lower-order factors and dependence on ε.
References
[1]
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, and Joachim Gudmundsson. 2009. Region-fault tolerant geometric spanners. Discrete and Computational Geometry 41, 4 (2009), 556–582. DOI:
[2]
Peyman Afshani, Lars Arge, and Kasper Dalgaard Larsen. 2010. Orthogonal range reporting: Query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. In Proceedings of the 26th Symposium on Computational Geometry.David G. Kirkpatrick and Joseph S. B. Mitchell (Eds.), ACM, 240–246. DOI:
[3]
Peyman Afshani and Anne Driemel. 2018. On the complexity of range searching among curves. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 898–917. DOI:
[4]
Mohamed H. Ali, John Krumm, Travis Rautman, and Ankur Teredesai. 2012. ACM SIGSPATIAL GIS cup 2012. In Proceedings of the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 597–600. DOI:
[5]
Helmut Alt, Alon Efrat, Günter Rote, and Carola Wenk. 2003. Matching planar maps. Journal of Algorithms 49, 2 (2003), 262–283. DOI:
[6]
Helmut Alt and Michael Godau. 1995. Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry and Applications 5 (1995), 75–91. DOI:
[7]
Julian Baldus and Karl Bringmann. 2017. A fast implementation of near neighbors queries for Fréchet distance (GIS Cup). In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 99:1–99:4. DOI:
[8]
Sotiris Brakatsoulas, Dieter Pfoser, Randall Salas, and Carola Wenk. 2005. On map-matching vehicle tracking data. In Proceedings of the 31st International Conference on Very Large Data Bases. ACM, 853–864. Retrieved from http://www.vldb.org/archives/website/2005/program/paper/fri/p853-brakatsoulas.pdf
[9]
Karl Bringmann. 2014. Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails. In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science. IEEE Computer Society, 661–670. DOI:
[10]
Karl Bringmann, Anne Driemel, André Nusser, and Ioannis Psarros. 2022. Tight bounds for approximate near neighbor searching for time series under the Fréchet distance. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms. SIAM, 517–550. DOI:
[11]
Karl Bringmann and Marvin Künnemann. 2017. Improved approximation for Fréchet distance on c-packed curves matching conditional lower bounds. International Journal of Computational Geometry and Applications 27, 1–2 (2017), 85–120. DOI:
[12]
Kevin Buchin, Maike Buchin, Wouter Meulemans, and Wolfgang Mulzer. 2017. Four soviets walk the dog: Improved bounds for computing the Fréchet distance. Discrete and Computational Geometry 58, 1 (2017), 180–216. DOI:
[13]
Kevin Buchin, Yago Diez, Tom van Diggelen, and Wouter Meulemans. 2017. Efficient trajectory queries under the Fréchet distance (GIS Cup). In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 101:1–101:4. DOI:
[14]
Kevin Buchin, Tim Ophelders, and Bettina Speckmann. 2019. SETH says: Weak Fréchet distance is faster, but only if it is continuous and in one dimension. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2887–2901. DOI:
[15]
Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, and Frank Staals. 2022. Efficient Fréchet distance queries for segments. In Proceedings of the 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (LIPIcs).Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman (Eds.), Vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 29:1–29:14. DOI:
[16]
Erin W. Chambers, Brittany Terese Fasy, Yusu Wang, and Carola Wenk. 2020. Map-matching using shortest paths. ACM Transactions on Spatial Algorithms and Systems 6, 1 (2020), 6:1–6:17. DOI:
[17]
Pingfu Chao, Yehong Xu, Wen Hua, and Xiaofang Zhou. 2020. A survey on map-matching algorithms. In Proceedings of the 31st Australasian Database Conference.Lecture Notes in Computer Science, Vol. 12008, Springer, 121–133. DOI:
[18]
Daniel Chen, Anne Driemel, Leonidas J. Guibas, Andy Nguyen, and Carola Wenk. 2011. Approximate map matching with respect to the Fréchet distance. In Proceedings of the 13th Workshop on Algorithm Engineering and Experiments. SIAM, 75–83. DOI:
[19]
Daniel Chen, Leonidas J. Guibas, Qixing Huang, and Jian Sun. 2008. A faster algorithm for matching planar maps under the weak Fréchet distance. Unpublished, December (2008).
[20]
Daniel Chen, Christian Sommer, and Daniel Wolleb. 2021. Fast map matching with vertex-monotone fréchet distance. In Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Vol. 96, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 10:1–10:20. DOI:
[21]
Richard Cole. 1987. Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM 34, 1 (1987), 200–208. DOI:
[22]
Mark de Berg, Joachim Gudmundsson, and Ali D. Mehrabi. 2017. A dynamic data structure for approximate proximity queries in trajectory data. In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 48:1–48:4. DOI:
[23]
Mark de Berg, Ali D. Mehrabi, and Tim Ophelders. 2017. Data structures for fréchet queries in trajectory data. In Proceedings of the 29th Canadian Conference on Computational Geometry. 214–219.
[24]
Edsger W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959), 269–271. DOI:
[25]
Anne Driemel and Sariel Har-Peled. 2013. Jaywalking your dog: Computing the Fréchet distance with shortcuts. SIAM Journal on Computing 42, 5 (2013), 1830–1866. DOI:
[26]
Anne Driemel, Sariel Har-Peled, and Carola Wenk. 2012. Approximating the Fréchet distance for realistic curves in near linear time. Discret. Comput. Geom. 48, 1 (2012), 94–127. DOI:
[27]
Anne Driemel and Ioannis Psarros. 2021. ANN for time series under the Fréchet distance. In Proceedings of the 17th International Symposium on Algorithms and Data Structures.Lecture Notes in Computer Science, Vol. 12808, Springer, 315–328. DOI:
[28]
Anne Driemel, Ioannis Psarros, and Melanie Schmidt. 2019. Sublinear data structures for short Fréchet queries. arXiv:1907.04420. Retrieved from http://arxiv.org/abs/1907.04420
[29]
Anne Driemel, Ivor van der Hoog, and Eva Rotenberg. 2022. On the discrete Fréchet distance in a graph. In Proceedings of the 38th Symposium on Computational Geometry. Vol. 224, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 36:1–36:18.
[30]
Christian A. Duncan, Michael T. Goodrich, and Stephen G. Kobourov. 2001. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. Journal of Algorithms 38, 1 (2001), 303–333. DOI:
[31]
Fabian Dütsch and Jan Vahrenhold. 2017. A filter-and-refinement-algorithm for range queries based on the Fréchet distance (GIS cup). In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 100:1–100:4. DOI:
[32]
Arnold Filtser and Omrit Filtser. 2021. Static and streaming data structures for fréchet distance queries. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1150–1170. DOI:
[33]
Arnold Filtser, Omrit Filtser, and Matthew J. Katz. 2020. Approximate nearest neighbor for curves - simple, efficient, and deterministic. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming. Vol. 168, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 48:1–48:19. DOI:
[34]
Omrit Filtser. 2018. Universal approximate simplification under the discrete Fréchet distance. Information Processing Letters 132 (2018), 22–27. DOI:
[35]
Bin Fu, Robert T. Schweller, and Tim Wylie. 2019. Discrete planar map matching. In Proceedings of the 31st Canadian Conference on Computational Geometry. 218–224.
[36]
Teofilo F. Gonzalez. 1985. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38 (1985), 293–306. DOI:
[37]
Joachim Gudmundsson, Michael Horton, John Pfeifer, and Martin P. Seybold. 2021. A practical index structure supporting fréchet proximity queries among trajectories. ACM Transactions on Spatial Algorithms and Systems 7, 3 (2021), 15:1–15:33. DOI:
[38]
Joachim Gudmundsson, Yuan Sha, and Sampson Wong. 2020. Approximating the packedness of polygonal curves. In Proceedings of the 31st International Symposium on Algorithms and Computation.Yixin Cao, Siu-Wing Cheng, and Minming Li (Eds.), Vol. 181, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1–9:15. DOI:
[39]
Joachim Gudmundsson and Michiel H. M. Smid. 2015. Fast algorithms for approximate Fréchet matching queries in geometric trees. Computational Geometry 48, 6 (2015), 479–494. DOI:
[40]
Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, and Sampson Wong. 2021. Translation invariant Fréchet distance queries. Algorithmica 83, 11 (2021), 3514–3533. DOI:
[41]
Mahdi Hashemi and Hassan A. Karimi. 2014. A critical review of real-time map-matching algorithms: Current issues and future directions. Computers, Environment and Urban Systems 48 (2014), 153–165. DOI:
[42]
Piotr Indyk. 2002. Approximate nearest neighbor algorithms for Frechet distance via product metrics. In Proceedings of the 18th Symposium on Computational Geometry. ACM, 102–106. DOI:
[43]
Matej Kubicka, Arben Çela, Hugues Mounier, and Silviu-Iulian Niculescu. 2018. Comparative study and application-oriented classification of vehicular map-matching methods. IEEE Intelligent Transportation Systems Magazine 10, 2 (2018), 150–166. DOI:
[44]
Nimrod Megiddo. 1983. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM 30, 4 (1983), 852–865. DOI:
[45]
Mohammed A. Quddus, Washington Y. Ochieng, and Robert B. Noland. 2007. Current map-matching algorithms for transport applications: State-of-the art and future research directions. Transportation Research Part C: Emerging Technologies 15, 5 (2007), 312–328.
[46]
Aviad Rubinstein. 2018. Hardness of approximate nearest neighbor search. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. ACM, 1260–1268. DOI:
[47]
Otfried Schwarzkopf and Jules Vleugels. 1996. Range searching in low-density environments. Information Processing Letters 60, 3 (1996), 121–127. DOI:
[48]
Martin P. Seybold. 2017. Robust map matching for heterogeneous data via dominance decompositions. In Proceedings of the 2017 SIAM International Conference on Data Mining. SIAM, 813–821. DOI:
[49]
Junichi Shigezumi, Tatsuya Asai, Hiroaki Morikawa, and Hiroya Inakoshi. 2015. A fast algorithm for matching planar maps with minimum fréchet distances. In Proceedings of the 4th International ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data. ACM, 25–34. DOI:
[50]
Ivor van der Hoog, Eva Rotenberg, and Sampson Wong. 2022. Data structures for Approximate Discrete Fréchet distance. arXiv:2212.07124. Retrieved from https://arxiv.org/abs/2212.07124
[51]
Hong Wei, Yin Wang, George Forman, and Yanmin Zhu. 2013. Map matching by Fréchet distance and global weight optimization. Technical Paper, Departement of Computer Science and Engineering (2013), 19.
[52]
Hong Wei, Yin Wang, George Forman, and Yanmin Zhu. 2013. Map matching: Comparison of approaches using sparse and noisy data. In Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 434–437. DOI:
[53]
Carola Wenk, Randall Salas, and Dieter Pfoser. 2006. Addressing the need for map-matching speed: Localizing globalb curve-matching algorithms. In Proceedings of the 18th International Conference on Scientific and Statistical Database Management. IEEE Computer Society, 379–388. DOI:
[54]
Ryan Williams. 2005. A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science 348, 2–3 (2005), 357–365. DOI:
[55]
Tim Wylie and Binhai Zhu. 2014. Intermittent map matching with the discrete fréchet distance. arXiv:1409.2456. Retrieved from https://arxiv.org/abs/1409.2456
[56]
Yu Zheng and Xiaofang Zhou (Eds.). 2011. Computing with Spatial Trajectories. Springer. DOI:
Index Terms
- Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance
Recommendations
Partial matching between surfaces using fréchet distance
SWAT'12: Proceedings of the 13th Scandinavian conference on Algorithm TheoryComputing the Fréchet distance for surfaces is a surprisingly hard problem. We introduce a partial variant of the Fréchet distance problem, which for given surfaces P and Q asks to compute a surface R⊆Q with minimum Fréchet distance to P. Like the ...
Translation Invariant Fréchet Distance Queries
AbstractThe Fréchet distance is a popular similarity measure between curves. For some applications, it is desirable to match the curves under translation before computing the Fréchet distance between them. This variant is called the Translation Invariant ...
Spanners under the Hausdorff and Fréchet distances
AbstractWe initiate the study of spanners under the Hausdorff and Fréchet distances. Let S be a set of points in R d and ε a non-negative real number. A subgraph H of the Euclidean graph over S is an ε-Hausdorff-spanner (resp., an ε-Fréchet-spanner) of S,...
Highlights- We initiate the study of spanners under the Hausdorff and Fréchet distances.
- We show that any t-spanner of a planar point-set S is a f(t)-Hausdorff-spanner and a g(t)-Fréchet spanner.
- We prove that for any t > 1, there exist a set ...
Comments
Information & Contributors
Information
Published In
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: 13 March 2024
Online AM: 30 January 2024
Accepted: 23 January 2024
Revised: 16 January 2024
Received: 23 December 2022
Published in TALG Volume 20, Issue 2
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 245Total Downloads
- Downloads (Last 12 months)238
- Downloads (Last 6 weeks)18
Reflects downloads up to 18 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in