Computing the discrete Fréchet distance in subquadratic time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2013, Pages 156-167

  Agarwal, Pankaj K ^a   Ben Avraham, Rinat ^b   Kaplan, Haim ^b   Sharir, Micha ^b,c  

^a Duke University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM ACCESS STORAGE;

DYNAMIC PROGRAMMING ALGORITHM; QUADRATIC TIME; RAM MODEL; SIMILARITY MEASURE; SUBQUADRATIC ALGORITHMS;

DYNAMIC PROGRAMMING;

EID: 84876064786     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973105.12     Document Type: Conference Paper

References (38)

1. P. K. Agarwal, B. Aronov, M. Sharir and S. Suri, Selecting distances in the plane, Algorithmica 9(5) (1993), 495-514.
2. P. K. Agarwal, R. Ben Avraham, H. Kaplan and M. Sharir, Computing the discrete Fréchet distance in subquadratic time, available at: http://arxiv.org/pdf/1204.5333.pdf (2012).
3. H. Alt, The computational geometry of comparing shapes, Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Springer-Verlag (2009), 235-248.
4. H. Alt and M. Godau, Computing the Fréchet distance between two polygonal curves, Internat. J. Comput. Geom. Appl. 5 (1995), 75-91.
5. H. Alt, C. Knauer and C. Wenk, Comparison of distance measures for planar curves, Algorithmica 38(1) (2004), 45-58.
6. B. Aronov, S. Har-Peled, C. Knauer, Y. Wang and C. Wenk, Fréchet distance for curves, revisited, Proc. 14th Annu. European Sympos. Algorithms (2006), 52-63.
7. I. Baran, E. D. Demaine and M. Patrascu, Subquadratic algorithms for 3SUM, Algorithmica 50(4) (2008), 584-596. (Pubitemid 351372107)
8. S. Brakatsoulas, D. Pfoser, R. Salas and C. Wenk, On map-matching vehicle tracking data, Proc. 31st Intl. Conf. Very Large Data Bases (2005), 853-864.
9. K. Buchin, M. Buchin and J. Gudmundsson, Detecting single file movement, Proc. 16th ACM SIGSPATIAL Intl. Conf. Adv. GIS (2008), 288-297.
10. K. Buchin, M. Buchin, J. Gudmundsson, M. Löffler and J. Luo. Detecting commuting patterns by clustering subtrajectories, Proc. 19th Annu. Intl. Sympos. Algorithms Comput. (2008), 644-655.
11. K. Buchin, M. Buchin, C. Knauer, G. Rote and C. Wenk, How difficult is it to walk the dog? Proc. 23rd Euro. Workshop Comput. Geom. (2007), 170-173.
12. K. Buchin, M. Buchin, W. Meulemans, W. Mulzer, Four soviets walk the dog - with an application to Alt's conjecture, available at: http://arxiv.org/pdf/ 1209.4403v1.pdf (2012).
13. T. M. Chan, More algorithms for all-pairs shortest paths in weighted graphs, SIAM J. Comput. 39(5) (2010), 2075-2089.
14. D. Chen, A. Driemel, L. J. Guibas, A. Nguyen and C. Wenk, Approximate map matching with respect to the Fréchet distance, Proc. 7th Workshop on Algorithm Engineering and Experiments (2011), 75-83.
15. A. F. Cook, A. Driemel, S. Har-Peled, J. Sherette and C. Wenk, Computing the Fréchet distance between folded polygons, Proc. 12th Intl. Sympos. Algorithms and Data Structures (2011), 267-278.
16. M. Crochemore, G. M. Landau and M. Ziv-Ukelson. A subquadratic sequence alignment algorithm for unrestricted scoring matrices, SIAM J. Comput. 32 (2003), 1654-1673.
17. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications, 3rd edition, Springer-Verlag, Berlin, 2008.
18. A. Driemel and S. Har-Peled, Jaywalking your dog: Computing the Fréchet distance with shortcuts, Proc. 23rd Annu. ACM-SIAM Sympos. Discrete Algorithms (2012), 318-337.
19. A. Driemel, S. Har-Peled and C. Wenk, Approximating the Fréchet distance for realistic curves in near linear time, Proc. 26th Annu. ACM Sympos. Comput. Geom. (2010), 365-374.
20. T. Eiter and H. Mannila, Computing discrete Fréchet distance, Technical Report CD-TR 94/64, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria, 1994.
21. T. Feder and R. Motwani, Clique partitions, graph compression and speeding-up algorithms, J. Comput. Sys. Sci. 51(2) (1995) 261-272.
22. 2) problems in computational geometry, Comput. Geom. Theory Appl. 5(3) (1995), 165-185.
23. S. Har-Peled and B. Raichel, The Fréchet distance revisited and extended, Proc. 27th Annu. ACM Sympos. Comput. Geom. (2011), 448-457.
24. D. Hermelin, G. M. Landau, S. Landau and O. Weimann, A unified algorithm for accelerating edit-distance computation via text-compression, Proc. 26th Sympos. Theoret. Asp. Comp. Sci. (2009), 529-540.
25. M. Jiang, Y. Xu and B. Zhu, Protein structure-structure alignment with discrete Fréchet distance, J. Bioinform. Comput. Biol. 6(1) (2008), 51-64. (Pubitemid 351711900)
26. M. J. Katz and M. Sharir, An expander-based approach to geometric optimization, SIAM J. Comput. 26(5) (1997), 1384-1408. (Pubitemid 127613097)
27. E. J. Keogh and M. J. Pazzani, Scaling up dynamic time warping to massive datasets, Proc. 3rd Euro. Conf. Princip. Data Mining and Know. Disc. (1999), 1-11.
28. M. S. Kim, S. W. Kim and M. Shin, Optimization of subsequence matching under time warping in time-series databases, Proc. ACM Sympos. Applied Comput. (2005), 581-586.
29. S. Kwong, Q. H. He, K. F. Man, K. S. Tang and C. W. Chau, Parallel genetic-based hybrid pattern matching algorithm for isolated word recognition, Intl. J. Pattern Recog. Art. Intel. 12(5) (1998), 573-594. (Pubitemid 128619414)
30. Y. Lifshits, S. Mozes, O. Weimann, and M. Ziv-Ukelson, Speeding up HMM decoding and training by exploiting sequence repetitions, Algorithmica 54 (2009), 379-399.
31. A. Maheshwari, J.-R. Sack, K. Shahbaz, H. Zarrabi-Zadeh, Improved algorithms for partial curve matching, Proc. 19th Annu. European Sympos. Algorithms (2011), 518-529.
32. A. Mascret, T. Devogele, I. Le Berre and A. Hénaff, Coastline matching process based on the discrete Fréchet distance, Proc. 12th Intl. Sympos. Spatial Data Handling (2006), 383-400.
33. W. J. Masek and M. S. Paterson, A faster algorithm computing string edit distances, J. Comput. Sys. Sci. 20(1) (1980), 18-31.
34. M. E. Munich and P. Perona, Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification, Proc. 7th Intl. Conf. Comp. Vision (1999), 108-115.
35. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
36. E. Sriraghavendra, K. Karthik and C. Bhattacharyya, Fréchet distance based approach for searching online handwritten documents, Proc. 9th Intl. Conf. Doc. Analy. Recog. (2007), 461-465.
37. C. Wenk, R. Salas and D. Pfoser, Addressing the need for map-matching speed: Localizing global curve-matching algorithms, Proc. 18th Intl. Conf. Scientific and Statistical Database Management (2006), 379-388.
38. B. Zhu, Protein local structure alignment under the discrete Fréchet distance, J. Copmut. Biology 14(10) (2007), 1343-1351. (Pubitemid 350249346)