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

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2010, Pages 365-374

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

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

Approximation algorithms; Fr chet distance; Realistic input models

Indexed keywords

INPUT MODELS; LOW DENSITY; NEAR-LINEAR TIME; POLYGONAL CURVE; REALISTIC INPUT MODELS; RUNNING TIME;

COMPUTATIONAL GEOMETRY;

APPROXIMATION ALGORITHMS;

EID: 77954939479     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810959.1811019     Document Type: Conference Paper

References (27)

1. 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:203-219, 2005.
2. H. Alt. The computational geometry of comparing shapes. In Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, pages 235-248. Springer-Verlag, 2009.
3. H. Alt and M. Buchin. Can we compute the similarity between surfaces? Discrete Comput. Geom., 43(1):78-99, 2010.
4. H. Alt, A. Efrat, G. Rote, and C. Wenk. Matching planar maps. J. Algorithms, 49:262-283, 2003.
5. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl., 5:75-91, 1995.
6. H. Alt, C. Knauer, and C. Wenk. Comparison of distance measures for planar curves. Algorithmica, 38(1):45-58, 2004.
7. B. Aronov and S. Har-Peled. On approximating the depth and related problems. SIAM J. Comput., 38(3):899-921, 2008.
8. B. Aronov, S. Har-Peled, C. Knauer, Y. Wang, and C. Wenk. Fréchet distance for curves, Revisited. In Proc. 14th Annu. European Sympos. Algorithms, pages 52-63, 2006.
9. P. Bose, O. Cheong, and V. Dujmovic. A note on the perimeter of fat objects. Comput. Geom. Theory Appl., 2010. To appear.
10. S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk. On map-matching vehicle tracking data. In Proc. 31st VLDB Conference, pages 853-864, 2005.
11. K. Buchin, M. Buchin, and J. Gudmundsson. Detecting single file movement. In Proc. 16th ACM SIGSPATIAL Int. Conf. Adv. GIS, pages 288-297, 2008.
12. K. Buchin, M. Buchin, J. Gudmundsson, Maarten L., and J. Luo. Detecting commuting patterns by clustering subtrajectories. In Proc. 19th Annu. Internat. Sympos. Algorithms Comput., pages 644-655, 2008.
13. K. Buchin, M. Buchin, C. Knauer, G. Rote, and C. Wenk. How difficult is it to walk the dog? In Proc. 23rd Euro. Workshop on Comput. Geom., pages 170-173, 2007.
14. P. B. Callahan and S. R. Kosaraju. 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.
15. M. de Berg. Linear size binary space partitions for uncluttered scenes. Algorithmica, 28:353-366, 2000.
16. M. de Berg. Improved bounds on the union complexity of fat objects. Discrete Comput. Geom., 40(1):127-140, 2008.
17. M. de Berg, M. J. Katz, A. F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. Algorithmica, 34:81-97, 2002.
18. A. Driemel, S. Har-Peled, and C. Wenk. Approximating the Fréchet distance for realistic curves in near linear time. http://arxiv.org/abs/1003. 0460, 2010.
19. A. Efrat. The complexity of the union of (α, β)-covered objects. SIAM J. Comput., 34(4):775-787, 2005.
20. J. Erickson. On the relative complexities of some geometric problems. In Proc. 7th Canad. Conf. Comput. Geom., pages 85-90, 1995.
21. M. Godau. On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Free University of Berlin, 1999.
22. E. J. Keogh and M. J. Pazzani. Scaling up dynamic time warping to massive dataset. In Proc. of the Third Euro. Conf. Princip. Data Mining and Know. Disc., pages 1-11, 1999.
23. M.S. Kim, S.W. Kim, and M. Shin. Optimization of subsequence matching under time warping in time-series databases. In Proc. ACM symp. Applied comput., pages 581-586, New York, NY, USA, 2005.
24. 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. Int. J. Pattern Recog. Art. Intel., 12(5):573-594, August 1998.
25. M. E. Munich and P. Perona. Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification. In Proc. 7th Int. Conf. Comp. Vision, pages 108-115, 1999.
26. E. Sriraghavendra, K. Karthik, and C. Bhattacharyya. Fréchet distance based approach for searching online handwritten documents. In Proc. 9th Int. Conf. Doc. Analy. Recog., pages 461-465, 2007.
27. C. Wenk, R. Salas, and D. Pfoser. Addressing the need for map-matching speed: Localizing global curve-matching algorithms. In Proc. 18th Int. Conf. Sci. Statis. Database Manag., pages 879-888, 2006.