Jaywalking your dog: Computing the fréchet distance with shortcuts

SIAM Journal on Computing

Volumn 42, Issue 5, 2013, Pages 1830-1866

  Driemel, Anne ^a   Har Peled, Sariel ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Approximation algorithms; Fr chet distance; Geometric similarity; Outliers

Indexed keywords

CONSTANT FACTORS; GEOMETRIC SIMILARITY; HANDLING NOISE; NATURAL APPROACHES; NEAR-LINEAR TIME; OPTIMAL APPROXIMATION; OUTLIERS; POLYGONAL CURVE;

DATA STRUCTURES; STATISTICS;

APPROXIMATION ALGORITHMS;

EID: 84890817120     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/120865112     Document Type: Conference Paper

References (38)

1. M. Abam, M. de Berg, P. Hachenberger, and A. Zarei, Streaming algorithms for line simplification, Discrete Comput. Geom., 43 (2010), pp. 497-515.
2. P. K. Agarwal, R. Ben Avraham, H. Kaplan, and M. Sharir, Computing the discrete Fréchet distance in subquadratic time, in Proceedings of the 24rd ACM-SIAM Symposium on Discrete Algorithms, 2013, pp. 156-167.
3. P. K. Agarwal, S. Har-Peled, N. Mustafa, and Y. Wang, Near-linear time approximation algorithms for curve simplification in two and three dimensions, Algorithmica, 42 (2005), pp. 203-219.
4. C. Aggarwal and S. Yu, An effective and efficient algorithm for high-dimensional outlier detection, Int. J. Very Large Data Bases, 14 (2005), pp. 211-221.
5. H. Alt, A. Efrat, G. Rote, and C. Wenk, Matching planar maps, J. Algorithms, 49 (2003), pp. 262-283.
6. H. Alt and M. Godau, Computing the Fréchet distance between two polygonal curves, Internat. J. Comput. Geom. Appl., 5 (1995), pp. 75-91.
7. J. L. Bentley and J. B. Saxe, Decomposable searching problems I: Static-to-dynamic transformation, J. Algorithms, 1 (1980), pp. 301-358.
8. S. Bereg, M. Jiang, W. Wang, B. Yang, and B. Zhu, Simplifying 3d polygonal chains under the discrete fréchet distance, in Proceedings of the 8th Latin American Symposium on Theoretical Informatics, 2008, pp. 630-641.
9. S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk, On map-matching vehicle tracking data, in Proceedings of the 31st VLDB Conference, 2005, pp. 853-864.
10. K. Buchin, M. Buchin, and J. Gudmundsson, Detecting single file movement, in Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2008, pp. 288-297.
11. K. Buchin, M. Buchin, J. Gudmundsson, Maarten L., and J. Luo, Detecting commuting patterns by clustering subtrajectories, in Proceedings of the 19th Annual International Symposium on Algorithms and Computation, 2008, pp. 644-655.
12. K. Buchin, M. Buchin, C. Knauer, G. Rote, and C. Wenk, How difficult is it to walk the dog?, in Proceedings of the 23rd European Workshop on Computational Geometry, 2007, pp. 170-173.
13. K. Buchin, M. Buchin, W. Meulemans, and W. Mulzer, Four Soviets Walk the Dog - With an Application to Alt's Conjecture, arXiv:1209.4403, 2012.
14. K. Buchin, M. Buchin, and Y. Wang, Exact algorithms for partial curve matching via the Fréchet distance, in Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 645-654.
15. K. Buchin, M. Buchin, and C. Wenk, Computing the Fréchet distance between simple polygons, Comput. Geom. Theory Appl., 41 (2008), pp. 2-20.
16. M. Buchin, A. Driemel, and B. Speckmann, Computing the Fréchet distance with shortcuts is NP-hard, in Proceedings of the 29th European Workshop on Computational Geometry, 2013, pp. 43-46.
17. D. Chen, A. Driemel, L. Guibas, A. Nguyen, and C. Wenk, Approximate map matching with respect to the Fréchet distance, in Proceedings of the 13th Workshop on Algorithm Engineering Experience, 2011.
18. M. de Berg, Improved bounds on the union complexity of fat objects, Discrete Comput. Geom., 40 (2008), pp. 127-140.
19. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications, 3rd ed., Springer, Berlin, 2008.
20. M. de Berg, M. J. Katz, A. F. van der Stappen, and J. Vleugels, Realistic input models for geometric algorithms, Algorithmica, 34 (2002), pp. 81-97.
21. M. de Berg and M. Streppel, Approximate range searching using binary space partitions, Comput. Geom. Theory Appl., 33 (2006), pp. 139-151.
22. A. Driemel, Realistic Analysis for Algorithmic Problems on Geographical Data, Ph.D. thesis, Utrecht University, 2013.
23. A. Driemel and S. Har-Peled, Jaywalking Your Dog - Computing the Fréchet Distance with Shortcuts, arXiv:1107.1720, 2011.
24. A. Driemel, S. Har-Peled, and C. Wenk, Approximating the Fréchet distance for realistic curves in near linear time, Discrete Comput. Geom., 48 (2012), pp. 94-127.
25. A. Efrat, The complexity of the union of (α, β)-covered objects, SIAM J. Comput., 34 (2005), pp. 775-787.
26. G. N. Frederickson and D. B. Johnson, Generalized selection and ranking: Sorted matrices, SIAM J. Comput., 13 (1984), pp. 14-30.
27. L. J. Guibas, J. Hershberger, J. S. B. Mitchell, and J. S. Snoeyink, Approximating polygons and subdivisions with minimum link paths, Internat. J. Comput. Geom. Appl., 3 (1993), pp. 383-415.
28. S. Har-Peled and B. Raichel, The Fréchet distance revisited and extended, in Proceedings of the 27th Annual ACM Symposium on Computational Geometry, 2011, pp. 448-457; also available online from http://www.cs.uiuc.edu/- sariel/papers/10/frechet3d/.
29. S. Har-Peled and B. Raichel, The Fréchet distance revisited and extended, ACM Trans. Algorithms, to appear.
30. E. J. Keogh and M. J. Pazzani, Scaling up dynamic time warping to massive dataset, in Proceedings of the 3rd European Conference on Principles of Data Mining and Knowledge Discovery, 1999, pp. 1-11.
31. M. S. Kim, S. W. Kim, and M. Shin, Optimization of subsequence matching under time warping in time-series databases, in Proceedings of the ACM Symposium on Applied Computing, 2005, pp. 581-586.
32. J. Gudmundsson, M. de Berg, and A. Cook IV, Fast Fréchet queries, in Proceedings of the 22nd Annual International Symposium on Algorithms and Computation, 2011.
33. A. Maheshwari, J.-R. Sack, K. Shahbaz, and H. Zarrabi-Zadeh, Fréchet distance with speed limits, Comput. Geom. Theory Appl., 44 (2011), pp. 110-120.
34. R. Maronna, D. Martin, and V. Yohai, Robust Statistics: Theory and Methods, Wiley, New York, 2006.
35. A. Mascret, T. Devogele, I. Le Berre, and A. Hénaff, Coastline matching process based on the discrete Fréchet distance, in Proceedings of the 12th International Symposium on Spatial Data Handling, 2006, pp. 383-400.
36. M. H. Overmars, The Design of Dynamic Data Structures, Lecture Notes in Comput. Sci. 156, Springer, Berlin, 1983.
37. J. Serrà, E. Gómez, P. Herrera, and X. Serra, Chroma binary similarity and local alignment applied to cover song identification, IEEE Trans. Audio Speech Language Process., 16 (2008), pp. 1138-1151.
38. C. Wenk, R. Salas, and D. Pfoser, Addressing the need for map-matching speed: Localizing global curve-matching algorithms, in Proceedings of the 18th International Conference Scientific and Statistical Database Management, 2006, pp. 879-888.