Approximating the Fréchet distance for realistic curves in near linear time

Discrete and Computational Geometry

Volumn 48, Issue 1, 2012, Pages 94-127

  Driemel, Anne ^a   Har Peled, Sariel ^b   Wenk, Carola ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

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

^c One UTSA Circle   (United States)

Author keywords

Approximation algorithms; Frechet distance; Realistic input models

Indexed keywords

EID: 84860888930     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-012-9402-z     Document Type: Article

References (24)

1. Agarwal, P. K., Har-Peled, S., Mustafa, N., Wang, Y.: Near-linear time approximation algorithms for curve simplification in two and three dimensions. Algorithmica 42, 203-219 (2005).
2. Alt, H.: The computational geometry of comparing shapes. In: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, pp. 235-248. Springer, Berlin (2009).
3. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75-91 (1995).
4. Alt, H., Knauer, C., Wenk, C.: Comparison of distance measures for planar curves. Algorithmica 38(1), 45-58 (2004).
5. Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SIAM J. Comput. 38(3), 899-921 (2008).
6. Aronov, B., Har-Peled, S., Knauer, C., Wang, Y., Wenk, C.: Fréchet distance for curves, revisited. In: Proc. 14th Annu. European Symp. Algorithms, pp. 52-63 (2006).
7. Bose, P., Cheong, O., Dujmović, V.: A note on the perimeter of fat objects. Comput. Geom. Theory Appl. 44(1), 1-8 (2011).
8. Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proc. 31st VLDB Conference, pp. 853-864 (2005).
9. Buchin, K., Buchin, M., Knauer, C., Rote, G., Wenk, C.: How difficult is it to walk the dog. In: Proc. 23rd Euro. Workshop on Comput. Geom., pp. 170-173 (2007).
10. Buchin, K., Buchin, M., Gudmundsson, J.: Detecting single file movement. In: Proc. 16th ACM SIGSPATIAL Int. Conf. Adv. GIS, pp. 288-297 (2008).
11. Buchin, K., Buchin, M., Gudmundsson, J., Maarten, L., Luo, J.: Detecting commuting patterns by clustering subtrajectories. In: Proc. 19th Annu. Internat. Symp. Algorithms Comput., pp. 644-655 (2008).
12. Callahan, P. B., Kosaraju, S. R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. Assoc. Comput. Mach. 42, 67-90 (1995).
13. de Berg, M.: Linear size binary space partitions for uncluttered scenes. Algorithmica 28, 353-366 (2000).
14. de Berg, M.: Improved bounds on the union complexity of fat objects. Discrete Comput. Geom. 40(1), 127-140 (2008).
15. de Berg, M., Katz, M. J., van der Stappen, A. F., Vleugels, J.: Realistic input models for geometric algorithms. Algorithmica 34, 81-97 (2002).
16. Driemel, A., Har-Peled, S., Wenk, C.: Approximating the Fréchet distance for realistic curves in near linear time. In: Proc. 26th Annu. ACM Symp. Comput. Geom., pp. 365-374 (2010). arXiv: 1003. 0460.
17. Efrat, A.: The complexity of the union of (α,β)-covered objects. SIAM J. Comput. 34(4), 775-787 (2005).
18. Erickson, J.: On the relative complexities of some geometric problems. In: Proc. 7th Canad. Conf. Comput. Geom., pp. 85-90 (1995).
19. Keogh, E. J., Pazzani, M. J.: Scaling up dynamic time warping to massive dataset. In: Proc. of the Third Euro. Conf. Princip. Data Mining and Know. Disc., pp. 1-11 (1999).
20. Kim, M. S., Kim, S. W., Shin, M.: Optimization of subsequence matching under time warping in time-series databases. In: Proc. ACM Symp. Appl. Comput., pp. 581-586 (2005).
21. Kwong, S., He, Q. H., Man, K. F., Tang, K. S., Chau, C. W.: Parallel genetic-based hybrid pattern matching algorithm for isolated word recognition. Int. J. Pattern Recognit. Artif. Intell. 12(5), 573-594 (1998).
22. Munich, M. E., Perona, P.: Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification. In: Proc. 7th Int. Conf. Comp. Vision, pp. 108-115 (1999).
23. Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fréchet distance based approach for searching online handwritten documents. In: Proc. 9th Int. Conf. Doc. Anal. Recogn., pp. 461-465 (2007).
24. Wenk, C., Salas, R., Pfoser, D.: Addressing the need for map-matching speed: localizing global curve-matching algorithms. In: Proc. 18th Int. Conf. Sci. Statist. Database Managm., pp. 879-888 (2006).