Document Open Access Logo

Faster Fréchet Distance Under Transformations

Authors Kevin Buchin , Maike Buchin , Zijin Huang , André Nusser , Sampson Wong

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.36.pdf
  • Filesize: 0.97 MB
  • 20 pages
HTML5 Logo HTML (experimental)
LIPIcs.ICALP.2025.36.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Fréchet distance
  • curve similarity
  • shape matching

Metrics

Abstract

We study the problem of computing the Fréchet distance between two polygonal curves under transformations. First, we consider translations in the Euclidean plane. Given two curves π and σ of total complexity n and a threshold δ ≥ 0, we present an 𝒪̃(n^{7 + 1/3}) time algorithm to determine whether there exists a translation t ∈ ℝ² such that the Fréchet distance between π and σ + t is at most δ. This improves on the previous best result, which is an 𝒪(n⁸) time algorithm.
We then generalize this result to any class of rationally parameterized transformations, which includes translation, rotation, scaling, and arbitrary affine transformations. For a class T of rationally parametrized transformations with k degrees of freedom, we show that one can determine whether there is a transformation τ ∈ T such that the Fréchet distance between π and τ(σ) is at most δ in 𝒪̃(n^{3k+4/3}) time.

Cite As Get BibTex

Kevin Buchin, Maike Buchin, Zijin Huang, André Nusser, and Sampson Wong. Faster Fréchet Distance Under Transformations. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 36:1-36:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.36

Author Details

Kevin Buchin
  • Technical University of Dortmund, Germany
Maike Buchin
  • Ruhr University Bochum, Germany
Zijin Huang
  • University of Sydney, Australia
André Nusser
  • Université Côte d'Azur, CNRS, Inria, Sophia Antipolis, France
Sampson Wong
  • BARC, University of Copenhagen, Denmark

Funding

  • Nusser, André: This work was supported by the French government through the France 2030 investment plan managed by the National Research Agency (ANR), as part of the Initiative of Excellence of Université Côte d'Azur under reference number ANR-15-IDEX-01.
  • Wong, Sampson: This work was supported by the European Union under a Marie Skłodowska-Curie Actions (MSCA) Postdoctoral Fellowship Grant number 101146276.

References

  1. Helmut Alt. The computational geometry of comparing shapes. In Susanne Albers, Helmut Alt, and Stefan Näher, editors, Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, volume 5760 of Lecture Notes in Computer Science, pages 235-248. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-03456-5_16.
  2. Helmut Alt and Michael Godau. Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry & Applications, 05:75-91, 1995. URL: https://doi.org/10.1142/S0218195995000064.
  3. Helmut Alt and Leonidas J. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. In Jörg-Rüdiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry, chapter 3, pages 121-153. North Holland / Elsevier, 2000. URL: https://doi.org/10.1016/B978-044482537-7/50004-8.
  4. Helmut Alt, Christian Knauer, and Carola Wenk. Matching polygonal curves with respect to the Fréchet distance. In Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 63-74. Springer, 2001. URL: https://doi.org/10.1007/3-540-44693-1_6.
  5. Helmut Alt, Ludmila Scharf, and Sven Scholz. Probabilistic matching and resemblance evaluation of shapes in trademark images. In Proc. 6th ACM International Conference on Image and Video Retrieval (CIVR), pages 533-540. ACM, 2007. URL: https://doi.org/10.1145/1282280.1282357.
  6. Boris Aronov, Tsuri Farhana, Matthew J. Katz, and Indu Ramesh. Discrete Fréchet distance oracles. In Proc. 40th International Symposium on Computational Geometry (SoCG), volume 293 of LIPIcs, pages 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.SOCG.2024.10.
  7. Rinat Ben Avraham, Haim Kaplan, and Micha Sharir. A faster algorithm for the discrete Fréchet distance under translation. CoRR, abs/1501.03724, 2015. URL: https://arxiv.org/abs/1501.03724.
  8. Julian Baldus and Karl Bringmann. 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, SIGSPATIAL'17, pages 99:1-99:4, New York, NY, USA, 2017. ACM. URL: https://doi.org/10.1145/3139958.3140062.
  9. Lotte Blank, Jacobus Conradi, Anne Driemel, Benedikt Kolbe, André Nusser, and Marena Richter. Transforming dogs on the line: On the Fréchet distance under translation or scaling in 1D. In Proceedings of the 41st International Symposium on Computational Geometry (SoCG), 2025. arXiv:2501.12821. URL: https://doi.org/10.48550/arXiv.2501.12821.
  10. Lotte Blank and Anne Driemel. A faster algorithm for the Fréchet distance in 1d for the imbalanced case. In Proc. 32nd Annual European Symposium on Algorithms (ESA), volume 308 of LIPIcs, pages 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ESA.2024.28.
  11. Karl Bringmann and Bhaskar Ray Chaudhury. Polyline simplification has cubic complexity. J. Comput. Geom., 11(2):94-130, 2020. URL: https://doi.org/10.20382/JOCG.V11I2A5.
  12. Karl Bringmann, Anne Driemel, André Nusser, and Ioannis Psarros. Tight bounds for approximate near neighbor searching for time series under the Fréchet distance. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 517-550. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.25.
  13. Karl Bringmann, Marvin Künnemann, and André Nusser. When lipschitz walks your dog: Algorithm engineering of the discrete fréchet distance under translation. In Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, editors, 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), volume 173 of LIPIcs, pages 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.ESA.2020.25.
  14. Karl Bringmann, Marvin Künnemann, and André Nusser. Discrete Fréchet distance under translation: Conditional hardness and an improved algorithm. ACM Trans. Algorithms, 17(3):25:1-25:42, 2021. URL: https://doi.org/10.1145/3460656.
  15. Karl Bringmann, Marvin Künnemann, and André Nusser. Walking the dog fast in practice: Algorithm engineering of the fréchet distance. J. Comput. Geom., 12(1):70-108, 2021. URL: https://doi.org/10.20382/JOCG.V12I1A4.
  16. Frederik Brüning, Jacobus Conradi, and Anne Driemel. Faster approximate covering of subcurves under the Fréchet distance. In Proc. 30th Annual European Symposium on Algorithms (ESA), volume 244 of LIPIcs, pages 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.ESA.2022.28.
  17. Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, and Jun Luo. Detecting commuting patterns by clustering subtrajectories. International Journal of Computational Geometry & Applications, 21(03):253-282, June 2011. URL: https://doi.org/10.1142/S0218195911003652.
  18. Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, and Sampson Wong. Map-matching queries under Fréchet distance on low-density spanners. In Proc. 40th International Symposium on Computational Geometry (SoCG), volume 293 of LIPIcs, pages 27:1-27:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.SOCG.2024.27.
  19. Kevin Buchin, Yago Diez, Tom van Diggelen, and Wouter Meulemans. 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, SIGSPATIAL'17, pages 101:1-101:4, New York, NY, USA, 2017. ACM. URL: https://doi.org/10.1145/3139958.3140064.
  20. Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler, and Martijn Struijs. Approximating (k, 𝓁)-center clustering for curves. In Proc. 30th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2922-2938. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.181.
  21. Kevin Buchin, Anne Driemel, Natasja van de L'Isle, and André Nusser. klcluster: Center-based clustering of trajectories. In Farnoush Banaei Kashani, Goce Trajcevski, Ralf Hartmut Güting, Lars Kulik, and Shawn D. Newsam, editors, Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2019, Chicago, IL, USA, November 5-8, 2019, pages 496-499. ACM, 2019. URL: https://doi.org/10.1145/3347146.3359111.
  22. Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, and Marcel Roeloffzen. Fréchet distance for uncertain curves. ACM Trans. Algorithms, 19(3):29:1-29:47, 2023. URL: https://doi.org/10.1145/3597640.
  23. Kevin Buchin, Brittany Terese Fasy, Erfan Hosseini Sereshgi, and Carola Wenk. On length-sensitive Fréchet similarity. In Proc. 18th International Symposium on Algorithms and Data Structures (WADS), volume 14079 of Lecture Notes in Computer Science, pages 208-231. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-38906-1_15.
  24. Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, and Kevin Verbeek. Computing the Fréchet distance between uncertain curves in one dimension. Comput. Geom., 109:101923, 2023. URL: https://doi.org/10.1016/J.COMGEO.2022.101923.
  25. 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 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2887-2901. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.179.
  26. Maike Buchin, Anne Driemel, and Dennis Rohde. Approximating (k, 𝓁)-median clustering for polygonal curves. ACM Trans. Algorithms, 19(1):4:1-4:32, 2023. URL: https://doi.org/10.1145/3559764.
  27. Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, and Frank Staals. Efficient Fréchet distance queries for segments. In Proc. 30th Annual European Symposium on Algorithms (ESA), volume 244 of LIPIcs, pages 29:1-29:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.ESA.2022.29.
  28. Siu-Wing Cheng and Haoqiang Huang. Curve simplification and clustering under Fréchet distance. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1414-1432. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH51.
  29. Siu-Wing Cheng and Haoqiang Huang. Fréchet distance in subquadratic time. CoRR, abs/2407.05231, 2024. To appear at SODA 2025. URL: https://doi.org/10.48550/arXiv.2407.05231.
  30. Siu-Wing Cheng and Haoqiang Huang. Solving Fréchet distance problems by algebraic geometric methods. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4502-4513. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.158.
  31. Connor Colombe and Kyle Fox. Approximating the (continuous) Fréchet distance. In Proc. 37th International Symposium on Computational Geometry (SoCG), volume 189 of LIPIcs, pages 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.SOCG.2021.26.
  32. Krzysztof Diks and Piotr Sankowski. Dynamic plane transitive closure. In Lars Arge, Michael Hoffmann, and Emo Welzl, editors, Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, volume 4698 of Lecture Notes in Computer Science, pages 594-604. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-75520-3_53.
  33. Anne Driemel, Ivor van der Hoog, and Eva Rotenberg. On the discrete Fréchet distance in a graph. In Proc. 38th International Symposium on Computational Geometry, (SoCG), volume 224 of LIPIcs, pages 36:1-36:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.SOCG.2022.36.
  34. Fabian Dütsch and Jan Vahrenhold. 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, SIGSPATIAL'17, pages 100:1-100:4, New York, NY, USA, 2017. ACM. URL: https://doi.org/10.1145/3139958.3140063.
  35. Alon Efrat, Piotr Indyk, and Suresh Venkatasubramanian. Pattern matching for sets of segments. Algorithmica, 40(3):147-160, 2004. URL: https://doi.org/10.1007/S00453-004-1089-Y.
  36. Chenglin Fan and Benjamin Raichel. Computing the Fréchet gap distance. Discrete & Computational Geometry, 65(4):1244-1274, June 2021. URL: https://doi.org/10.1007/s00454-020-00224-w.
  37. Arnold Filtser and Omrit Filtser. Static and streaming data structures for Fréchet distance queries. ACM Trans. Algorithms, 19(4):39:1-39:36, 2023. URL: https://doi.org/10.1145/3610227.
  38. Arnold Filtser, Omrit Filtser, and Matthew J. Katz. Approximate nearest neighbor for curves: Simple, efficient, and deterministic. Algorithmica, 85(5):1490-1519, 2023. URL: https://doi.org/10.1007/S00453-022-01080-1.
  39. Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, and Valentin Polishchuk. On flipping the Fréchet distance. In Proc. 14th Innovations in Theoretical Computer Science Conference (ITCS), volume 251 of LIPIcs, pages 51:1-51:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPICS.ITCS.2023.51.
  40. Emily Fox, Amir Nayyeri, Jonathan James Perry, and Benjamin Raichel. Fréchet edit distance. In Proc. 40th International Symposium on Computational Geometry (SoCG), volume 293 of LIPIcs, pages 58:1-58:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.SOCG.2024.58.
  41. Joachim Gudmundsson, Zijin Huang, André van Renssen, and Sampson Wong. Computing a Subtrajectory Cluster from c-Packed Trajectories. In Satoru Iwata and Naonori Kakimura, editors, 34th International Symposium on Algorithms and Computation (ISAAC 2023), volume 283 of Leibniz International Proceedings in Informatics (LIPIcs), pages 34:1-34:15, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2023.34.
  42. Joachim Gudmundsson, Martin P. Seybold, and Sampson Wong. Map matching queries on realistic input graphs under the Fréchet distance. In Proc. 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1464-1492. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH53.
  43. Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, and Sampson Wong. Translation invariant Fréchet distance queries. Algorithmica, 83(11):3514-3533, 2021. URL: https://doi.org/10.1007/S00453-021-00865-0.
  44. Joachim Gudmundsson and Sampson Wong. Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 173-189. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.9.
  45. Minghui Jiang, Ying Xu, and Binhai Zhu. Protein structure-structure alignment with discrete Fréchet distance. In Proc. 5th Asia-Pacific Bioinformatics Conference (APBC), volume 5 of Advances in Bioinformatics and Computational Biology, pages 131-141. Imperial College Press, 2007. URL: http://www.comp.nus.edu.sg/%7Ewongls/psZ/apbc2007/apbc162a.pdf.
  46. Adam Karczmarz and Marcin Smulewicz. Fully Dynamic Strongly Connected Components in Planar Digraphs. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), volume 297 of Leibniz International Proceedings in Informatics (LIPIcs), pages 95:1-95:20, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ICALP.2024.95.
  47. Christian Knauer. Algorithms for Comparing Geometric Patterns. PhD thesis, Free University Berlin, 2002. URL: https://doi.org/10.17169/refubium-16312.
  48. Abhinandan Nath and Erin Taylor. k-median clustering under discrete Fréchet and hausdorff distances. In Proc. 36th International Symposium on Computational Geometry (SoCG), volume 164 of LIPIcs, pages 58:1-58:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.SOCG.2020.58.
  49. E. Sriraghavendra, K. Karthik, and Chiranjib Bhattacharyya. Fréchet distance based approach for searching online handwritten documents. In Proc. 9th International Conference on Document Analysis and Recognition (ICDAR), pages 461-465. IEEE Computer Society, 2007. URL: https://doi.org/10.1109/ICDAR.2007.4378752.
  50. Sairam Subramanian. A fully dynamic data structure for reachability in planar digraphs. In Thomas Lengauer, editor, Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, volume 726 of Lecture Notes in Computer Science, pages 372-383. Springer, 1993. URL: https://doi.org/10.1007/3-540-57273-2_72.
  51. Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, and Carola Wenk. Global curve simplification. In Proc. 27th Annual European Symposium on Algorithms (ESA), volume 144 of LIPIcs, pages 67:1-67:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.ESA.2019.67.
  52. Thijs van der Horst and Tim Ophelders. Faster Fréchet distance approximation through truncated smoothing. In Proc. 40th International Symposium on Computational Geometry (SoCG), volume 293 of LIPIcs, pages 63:1-63:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.SOCG.2024.63.
  53. 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. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH67.
  54. Marc J. van Kreveld, Maarten Löffler, and Lionov Wiratma. On optimal polyline simplification using the Hausdorff and Fréchet distance. J. Comput. Geom., 11(1):1-25, 2020. URL: https://doi.org/10.20382/JOCG.V11I1A1.
  55. Remco C. Veltkamp. Shape matching: Similarity measures and algorithms. In Proc. International Conference on Shape Modeling and Applications (SMI), page 188. IEEE Computer Society, 2001. URL: https://doi.org/10.1109/SMA.2001.923389.
  56. Carola Wenk. Shape Matching in Higher Dimensions. PhD thesis, Free University Berlin, 2003. URL: https://doi.org/10.17169/refubium-8310.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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