Joachim Gudmundsson
Skip Abstract Section
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 ε.
- [1] . 2009. Region-fault tolerant geometric spanners. Discrete and Computational Geometry 41, 4 (2009), 556–582.
DOI: Google Scholar
Digital Library
- [2] . 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. and (Eds.), ACM, 240–246.
DOI: Google ScholarDigital Library - [3] . 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: Google ScholarCross Ref
- [4] . 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: Google ScholarDigital Library - [5] . 2003. Matching planar maps. Journal of Algorithms 49, 2 (2003), 262–283.
DOI: Google ScholarDigital Library - [6] . 1995. Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry and Applications 5 (1995), 75–91.
DOI: Google ScholarCross Ref - [7] . 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: Google ScholarDigital Library - [8] . 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.pdfGoogle ScholarDigital Library
- [9] . 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: Google ScholarDigital Library - [10] . 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: Google ScholarCross Ref - [11] . 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: Google ScholarCross Ref - [12] . 2017. Four soviets walk the dog: Improved bounds for computing the Fréchet distance. Discrete and Computational Geometry 58, 1 (2017), 180–216.
DOI: Google ScholarDigital Library - [13] . 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: Google ScholarDigital Library - [14] . 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:
DOI: Google ScholarCross Ref - [15] . 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)., , , and (Eds.), Vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 29:1–29:14.
DOI: Google ScholarCross Ref - [16] . 2020. Map-matching using shortest paths. ACM Transactions on Spatial Algorithms and Systems 6, 1 (2020), 6:1–6:17.
DOI: Google ScholarDigital Library - [17] . 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: Google ScholarDigital Library - [18] . 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: Google ScholarCross Ref - [19] . 2008. A faster algorithm for matching planar maps under the weak Fréchet distance. Unpublished, December (2008).Google Scholar
- [20] . 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: Google ScholarCross Ref - [21] . 1987. Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM 34, 1 (1987), 200–208.
DOI: Google ScholarDigital Library - [22] . 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: Google ScholarDigital Library - [23] . 2017. Data structures for fréchet queries in trajectory data. In Proceedings of the 29th Canadian Conference on Computational Geometry. 214–219.Google Scholar
- [24] . 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959), 269–271.
DOI: Google ScholarDigital Library - [25] . 2013. Jaywalking your dog: Computing the Fréchet distance with shortcuts. SIAM Journal on Computing 42, 5 (2013), 1830–1866.
DOI: Google ScholarDigital Library - [26] . 2012. Approximating the Fréchet distance for realistic curves in near linear time. Discret. Comput. Geom. 48, 1 (2012), 94–127.
DOI: Google ScholarCross Ref - [27] . 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: Google ScholarDigital Library - [28] . 2019. Sublinear data structures for short Fréchet queries.
arXiv:1907.04420. Retrieved from http://arxiv.org/abs/1907.04420Google Scholar - [29] . 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.Google Scholar
- [30] . 2001. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. Journal of Algorithms 38, 1 (2001), 303–333.
DOI: Google ScholarDigital Library - [31] . 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: Google ScholarDigital Library - [32] . 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: Google ScholarCross Ref - [33] . 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: Google ScholarCross Ref - [34] . 2018. Universal approximate simplification under the discrete Fréchet distance. Information Processing Letters 132 (2018), 22–27.
DOI: Google ScholarCross Ref - [35] . 2019. Discrete planar map matching. In Proceedings of the 31st Canadian Conference on Computational Geometry. 218–224.Google Scholar
- [36] . 1985. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38 (1985), 293–306.
DOI: Google ScholarCross Ref - [37] . 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: Google ScholarDigital Library - [38] . 2020. Approximating the packedness of polygonal curves. In Proceedings of the 31st International Symposium on Algorithms and Computation., , and (Eds.), Vol. 181, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1–9:15.
DOI: Google ScholarCross Ref - [39] . 2015. Fast algorithms for approximate Fréchet matching queries in geometric trees. Computational Geometry 48, 6 (2015), 479–494.
DOI: Google ScholarDigital Library - [40] . 2021. Translation invariant Fréchet distance queries. Algorithmica 83, 11 (2021), 3514–3533.
DOI: Google ScholarDigital Library - [41] . 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: Google ScholarCross Ref - [42] . 2002. Approximate nearest neighbor algorithms for Frechet distance via product metrics. In Proceedings of the 18th Symposium on Computational Geometry. ACM, 102–106.
DOI: Google ScholarDigital Library - [43] . 2018. Comparative study and application-oriented classification of vehicular map-matching methods. IEEE Intelligent Transportation Systems Magazine 10, 2 (2018), 150–166.
DOI: Google ScholarCross Ref - [44] . 1983. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM 30, 4 (1983), 852–865.
DOI: Google ScholarDigital Library - [45] . 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.Google ScholarCross Ref
- [46] . 2018. Hardness of approximate nearest neighbor search. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. ACM, 1260–1268.
DOI: Google ScholarDigital Library - [47] . 1996. Range searching in low-density environments. Information Processing Letters 60, 3 (1996), 121–127.
DOI: Google ScholarDigital Library - [48] . 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: Google ScholarCross Ref - [49] . 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: Google ScholarDigital Library - [50] . 2022. Data structures for Approximate Discrete Fréchet distance. arXiv:2212.07124. Retrieved from https://arxiv.org/abs/2212.07124Google Scholar
- [51] . 2013. Map matching by Fréchet distance and global weight optimization. Technical Paper, Departement of Computer Science and Engineering (2013), 19.Google Scholar
- [52] . 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: Google ScholarDigital Library - [53] . 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: Google ScholarDigital Library - [54] . 2005. A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science 348, 2–3 (2005), 357–365.
DOI: Google ScholarDigital Library - [55] . 2014. Intermittent map matching with the discrete fréchet distance. arXiv:1409.2456. Retrieved from https://arxiv.org/abs/1409.2456Google Scholar
- [56] and (Eds.). 2011. Computing with Spatial Trajectories. Springer.
DOI: Google ScholarCross Ref
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 ...
Fast fréchet distance between curves with long edges
IWISC '18: Proceedings of the 3rd International Workshop on Interactive and Spatial ComputingComputing Fréchet distance between two curves takes roughly quadratic time. The only strongly subquadratic time algorithm has been proposed in [7] for c-packed curves. In this paper, we show that for curves with long edges the Fréchet distance ...
Comments