Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fréchet Edit Distance (2403.12878v1)

Published 19 Mar 2024 in cs.CG

Abstract: We define and investigate the Fr\'{e}chet edit distance problem. Given two polygonal curves $\pi$ and $\sigma$ and a threshhold value $\delta>0$, we seek the minimum number of edits to $\sigma$ such that the Fr\'{e}chet distance between the edited $\sigma$ and $\pi$ is at most $\delta$. For the edit operations we consider three cases, namely, deletion of vertices, insertion of vertices, or both. For this basic problem we consider a number of variants. Specifically, we provide polynomial time algorithms for both discrete and continuous Fr\'{e}chet edit distance variants, as well as hardness results for weak Fr\'{e}chet edit distance variants.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. Approximating dynamic time warping and edit distance for a pair of point sequences. In Proceedings of the 32nd International Symposium on Computational Geometry, pages 6:1–6:16, 2016.
  2. Map Construction Algorithms. Springer, 2015.
  3. Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geometry Appl., 5:75–91, 1995.
  4. The discrete and semicontinuous Fréchet distance with shortcuts via approximate distance counting and selection. ACM Trans. Algorithms, 11(4):29:1–29:29, 2015.
  5. Karl Bringmann. Why walking the dog takes time: Fréchet distance has no strongly subquadratic algorithms unless SETH fails. In Proceedings of the IEEE 55th Annual Symposium on Foundations of Computer Science, pages 661–670, 2014.
  6. Approximability of the discrete Fréchet distance. JoCG, 7(2):46–76, 2016.
  7. Computing the Fréchet distance between uncertain curves in one dimension. Comput. Geom., 109:101923, 2023. doi:10.1016/j.comgeo.2022.101923.
  8. Computing the Fréchet distance with shortcuts is np-hard. In Siu-Wing Cheng and Olivier Devillers, editors, 30th Annual Symposium on Computational Geometry, page 367. ACM, 2014. doi:10.1145/2582112.2582144.
  9. The k-outlier fréchet distance, 2022. arXiv:2202.12824.
  10. Timothy M. Chan. Improved deterministic algorithms for linear programming in low dimensions. ACM Trans. Algorithms, 14(3), 2018.
  11. Approximate map matching with respect to the Fréchet distance. In Proc. 13th Meeting on Algorithm Engineering and Experiments, pages 75–83, 2011.
  12. On the marriage of Lp-norms and edit distance. In Proceedings of the 30th International Conference on Very Large Databases, pages 792–803, 2004.
  13. Robust and fast similarity search for moving object trajectories. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pages 491–502, 2005.
  14. On Computing the k-Shortcut Fréchet Distance. In Proc. 49th Intern. Colloquium Automata, Languages, Programming, pages 46:1–46:20, 2022.
  15. Jaywalking your dog: Computing the Fréchet distance with shortcuts. SIAM J. Comput., 42(5):1830–1866, 2013. doi:10.1137/120865112.
  16. Algorithms for the discrete Fréchet distance under translation. J. Comput. Geom., 11(1):156–175, 2020.
  17. Approximating the geometric edit distance. Algorithmica, 84(9):2395–2413, 2022.
  18. Dynamic time warping and geometric edit distance: Breaking the quadratic barrier. ACM Transactions on Algorithms, 14(4):50, 2018.
  19. Approximating polygons and subdivisions with minimum link paths. Int. J. Comput. Geom. Appl., 3(4):383–415, 1993. doi:10.1142/S0218195993000257.
  20. The Fréchet distance revisited and extended. ACM Trans. Algorithms, 10(1):3:1–3:22, 2014. doi:10.1145/2532646.
  21. Protein structure-structure alignment with discrete Fréchet distance. J. Bioinformatics and Computational Biology, 6(1):51–64, 2008.
  22. Pierre-François Marteau. Time warp edit distance with stiffness adjustment for time series matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2):306–318, 2009.
  23. Nimrod Megiddo. Linear programming in linear time when the dimension is fixed. J. ACM, 31(1):114–127, 1984.
  24. Model-driven matching and segmentation of trajectories. In Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 234–243, 2013.
  25. Fréchet distance based approach for searching online handwritten documents. In Proc. 9th Intern. Conf. Document Analysis and Recognition, pages 461–465, 2007.
  26. Geometric aspects of biological sequence comparison. Journal of Computational Biology, 16(4):579–611, 2009.
  27. Experimental comparison of representation methods and distance measures for time series data. Data Mining and Knowledge Discovery, 26(2):275–309, 2013.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now