Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds-Reference-Cited by-同舟云学术

Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds

Published:2015 Issue: Volume: Page:517-528
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Bringmann Karl,Künnemann Marvin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-48971-0_44

Reference16 articles.

1. Agarwal, P., Avraham, R.B., Kaplan, H., Sharir, M.: Computing the discrete Fréchet distance in subquadratic time. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 156–167 (2013)

2. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl. 5(1–2), 78–99 (1995)

3. Alt, H., Knauer, C., Wenk, C.: Comparison of distance measures for planar curves. Algorithmica 38(1), 45–58 (2004)

4. Lecture Notes in Computer Science;B Aronov,2006

5. Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB 2005), pp. 853–864 (2005)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings;International Journal of Data Science and Analytics;2022-01-29

2. A fast implementation of near neighbors queries for Fréchet distance (GIS Cup);Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems;2017-11-07