Document Open Access Logo

Faster Fréchet Distance Approximation Through Truncated Smoothing

Authors Thijs van der Horst, Tim Ophelders

PDF
Thumbnail PDF

File

LIPIcs.SoCG.2024.63.pdf
  • Filesize: 0.84 MB
  • 15 pages

Document Identifiers

Author Details

Thijs van der Horst
  • Department of Information and Computing Sciences, Utrecht University, The Netherlands
  • Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands
Tim Ophelders
  • Department of Information and Computing Sciences, Utrecht University, The Netherlands
  • Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands

Funding

  • Ophelders, Tim: Partially supported by the Dutch Research Council (NWO) under the project number VI.Veni.212.260.

Cite As Get BibTex

Thijs van der Horst and Tim Ophelders. Faster Fréchet Distance Approximation Through Truncated Smoothing. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 63:1-63:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.SoCG.2024.63

Abstract

The Fréchet distance is a popular distance measure for curves. Computing the Fréchet distance between two polygonal curves of n vertices takes roughly quadratic time, and conditional lower bounds suggest that even approximating to within a factor 3 cannot be done in strongly-subquadratic time, even in one dimension. The current best approximation algorithms present trade-offs between approximation quality and running time. Recently, van der Horst et al. (SODA, 2023) presented an O((n²/α) log³ n) time α-approximate algorithm for curves in arbitrary dimensions, for any α ∈ [1, n]. Our main contribution is an approximation algorithm for curves in one dimension, with a significantly faster running time of O(n log³ n + (n²/α³) log²n log log n). Additionally, we give an algorithm for curves in arbitrary dimensions that improves upon the state-of-the-art running time by a logarithmic factor, to O((n²/α) log² n). Both of our algorithms rely on a linear-time simplification procedure that in one dimension reduces the complexity of the reachable free space to O(n²/α) without making sacrifices in the asymptotic approximation factor.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Frécht distance
  • approximation algorithms
  • simplification

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, and Micha Sharir. Computing the discrete Fréchet distance in subquadratic time. SIAM Journal on Computing, 43(2):429-449, 2014. URL: https://doi.org/10.1137/130920526.
  2. Helmut Alt and Michael Godau. Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry & Applications, 5:75-91, 1995. URL: https://doi.org/10.1142/S0218195995000064.
  3. Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, and Carola Wenk. Fréchet distance for curves, revisited. In proc. 14th Annual European Symposium on Algorithms (ESA), pages 52-63, 2006. URL: https://doi.org/10.1007/11841036_8.
  4. Karl Bringmann. Why walking the dog takes time: Fréchet distance has no strongly subquadratic algorithms unless SETH fails. In proc. 55th Annual Symposium on Foundations of Computer Science (FOCS), pages 661-670, 2014. URL: https://doi.org/10.1109/FOCS.2014.76.
  5. Karl Bringmann and Marvin Künnemann. Improved approximation for Fréchet distance on c-packed curves matching conditional lower bounds. International Journal of Computational Geometry & Applications, 27(1-2):85-120, 2017. URL: https://doi.org/10.1142/S0218195917600056.
  6. Karl Bringmann and Wolfgang Mulzer. Approximability of the discrete Fréchet distance. Journal of Computational Geometry, 7(2):46-76, 2016. URL: https://doi.org/10.20382/jocg.v7i2a4.
  7. Kevin Buchin, Maike Buchin, Wouter Meulemans, and Wolfgang Mulzer. Four soviets walk the dog: Improved bounds for computing the Fréchet distance. Discrete & Computational Geometry, 58(1):180-216, 2017. URL: https://doi.org/10.1007/s00454-017-9878-7.
  8. Kevin Buchin, Tim Ophelders, and Bettina Speckmann. SETH says: Weak Fréchet distance is faster, but only if it is continuous and in one dimension. In proc. 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2887-2901, 2019. URL: https://doi.org/10.1137/1.9781611975482.179.
  9. Erin Wolf Chambers, Elizabeth Munch, and Tim Ophelders. A family of metrics from the truncated smoothing of Reeb graphs. In proc. 37th International Symposium on Computational Geometry (SoCG), pages 22:1-22:17, 2021. URL: https://doi.org/10.4230/LIPIcs.SoCG.2021.22.
  10. Timothy M. Chan and Zahed Rahmati. An improved approximation algorithm for the discrete Fréchet distance. Information Processing Letters, 138:72-74, 2018. URL: https://doi.org/10.1016/j.ipl.2018.06.011.
  11. Lei Chen, M. Tamer Özsu, and Vincent Oria. Robust and fast similarity search for moving object trajectories. In proc. 31st ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 491-502, 2005. URL: https://doi.org/10.1145/1066157.1066213.
  12. Connor Colombe and Kyle Fox. Approximating the (continuous) Fréchet distance. In proc. 37th International Symposium on Computational Geometry (SoCG), pages 26:1-26:14, 2021. URL: https://doi.org/10.4230/LIPIcs.SoCG.2021.26.
  13. Anne Driemel, Sariel Har-Peled, and Carola Wenk. Approximating the Fréchet distance for realistic curves in near linear time. Discrete & Computational Geometry, 48(1):94-127, 2012. URL: https://doi.org/10.1007/s00454-012-9402-z.
  14. Anne Driemel, Amer Krivosija, and Christian Sohler. Clustering time series under the Fréchet distance. In proc. 27th Annual Symposium on Discrete Algorithms (SODA), pages 766-785, 2016. URL: https://doi.org/10.1137/1.9781611974331.ch55.
  15. Thomas Eiter and Heikki Mannila. Computing discrete Fréchet distance. Technical report, Vienna University of Technology, 1994. Google Scholar
  16. Michael Godau. A natural metric for curves - Computing the distance for polygonal chains and approximation algorithms. In proc. 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 127-136, 1991. URL: https://doi.org/10.1007/BFb0020793.
  17. Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, and Carola Wenk. Fast Fréchet distance between curves with long edges. International Journal of Computational Geometry & Applications, 29(2):161-187, 2019. URL: https://doi.org/10.1142/S0218195919500043.
  18. Xiao-Ying Liu and Chuan-Lun Ren. Fast subsequence matching under time warping in time-series databases. In proc. 12th International Conference on Machine Learning and Cybernetics (ICML), pages 1584-1590, 2013. URL: https://doi.org/10.1109/ICMLC.2013.6890855.
  19. Mario E. Munich and Pietro Perona. Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification. In proc. 7th International Conference on Computer Vision (ICCV), pages 108-115, 1999. URL: https://doi.org/10.1109/ICCV.1999.791205.
  20. Thijs van der Horst and Tim Ophelders. Faster Fréchet distance approximation through truncated smoothing, 2024. URL: https://arxiv.org/abs/2401.14815.
  21. Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, and Bettina Speckmann. A subquadratic n^ε-approximation for the continuous Fréchet distance. In proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1759-1776, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch67.
  22. Jean Vuillemin. A unifying look at data structures. Communications of the ACM, 23(4):229-239, 1980. URL: https://doi.org/10.1145/358841.358852.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact