Exact algorithms for partial curve matching via the Fréchet distance

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 645-654

  Buchin, Kevin ^a   Buchin, Maike ^a   Wang, Yusu ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CURVE MATCHING; CURVE SIMILARITIES; DISTANCE MEASURE; EXACT ALGORITHMS; LONGEST PATH PROBLEMS; PARTIAL SIMILARITIES; POLYGONAL CURVE; POLYNOMIAL-TIME;

POLYNOMIAL APPROXIMATION;

EID: 70349092244     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.71     Document Type: Conference Paper

References (31)

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 and M. Buchin. Can we compute the similarity between surfaces?, 2007. arXiv:cs/0703011v1.
3. H. Alt, A. Efrat, G. Rote, and C. Wenk. Matching planar maps. J. Algorithms, 49:262-283, 2003.
4. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Internat J. Comput Geom. Appl., 5:75-91, 1995.
5. H. Alt and L. J. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 121-153. Elsevier Science Publishers B. V. North-Holland, Amsterdam, 2000.
6. H. Alt, C. Knauer, and C. Wenk. Matching polygonal curves with respect to the fréchet distance. In Proc. 18th Internat Sympos. Theoret Asp. Comp. Sci., pages 63-74, 2001. (Pubitemid 33241740)
7. H. Alt, C. Knauer, and C. Wenk. Comparison of distance measures for planar curves. Algorithmica, 38(1):45-58, 2004.
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. S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk. On map-matching vehicle tracking data. In Proc 31st VLDB Conference, pages 853-864, 2005.
10. K. Buchin, M. Buchin, and J. Gudmundsson. Detecting single file movement. In "Proc. 16th ACM SIGSPATIAL Internat Conf. Advances in Geogruphic Information Systems", 2008. To appear.
11. K. Buchin, M. Buchin, J. Gudmundsson, M. Löffler, and J. Luo. Detecting commuting patterns by clustering subtrajectories. In Proc. 19th Internat Sympos. Algorithms and Computation, 2008. To appear.
12. K. Buchin, M. Buchin, C. Knauer, G. Rote, and C. Wenk. How difficult is it to walk the dog? In Proc 23rd Europ. Workshop Comput Geom., pages 170-173, 2007.
13. K. Buchin, M. Buchin, and C. Wenk. Computing the Fréchet distance between simple polygons. Comput. Geom. Theory Appl., 41(1-2):2-20, 2008.
14. M. Buchin. On the Computability of the Fréchet Distance Between Triangulated Surfaces. PhD thesis, Dept. of Comput. Sci., Freie Universität Berlin, 2007.
15. D. Cardoze and L. Schulman, Pattern matching for spatial point sets. In Proc. 39th IEEE Sympos. Found. Comput Sci., pages 156-165, 1998.
16. E. W. Chambers, E. C. de Verdière, J. Erickson, S. Lazard, F. Lazarus, and S. Thite. Walking your dog in the woods in polynomial time. In Proc 24th ACM Sympos. Comput Geom., pages 101-109, 2008.
17. M. Clausen and A. Mosig. Approximately matching polygonal curves with respect to the Fréchet distance. Comput Geom. Theory Appl., 30:113-127, 2005.
18. A. F. Cook and C. Wenk. Geodesic Fréchet distance inside a simple polygon. In Proc. 25th Internat. Sympos. Theoret. Asp. Comp. Sci., pages 193-204, 2008.
19. A. Efrat, Q. Fan, and S. Venkatasubramanian. Curve matching, time warping, and light fields, new algorithms for computing similarity between curves. J. Math. Imaging Vis., 27(3):203-216, 2007.
20. A. Efrat, S. Har-Peled, L. J. Guibas, J. S. Mitchell, and T. Murali. New similarity measures between polylines with applications to morphing and polygon sweeping. Discrete Comput Geom., 28:535-569, 2002. (Pubitemid 36161397)
21. P. Indyk. Approximate nearest neighbor algorithms for Fréchet distance via product metrics. In Proc. 18th ACM Sympos. Comput Geom., pages 102-106, 2002. (Pubitemid 34975531)
22. P. Indyk, R. Motwani, and S. Venkatasubramanian. Geometric matching under noise: Combinatorial bounds and algorithms. In Proc 10th ACM-SIAM Sympos. Discrete Algorithms, pages 457-465, 1999.
23. E. J. Keogh and M. J. Pazzani. Scaling up dynamic time warping to massive dataset. In Proc 3rd Euro. Conf. Princip. Data Mining and Know. Disc., pages 1-11, 1999.
24. M. Kim, S. 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.
25. R. Kolodny, P. Koehl, and M. Levitt. Comprehensive evaluation of protein structure alignment: Scoring by geometric measures. J. Mol. Biol., 346:1173-1188, 2005.
26. 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 Recognition & Artificial Intelligence, 12(5):573-594, August 1998.
27. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, chapter 15, pages 633-701. Elsevier, 2000.
28. M. Parizeau and R. Plamondon. A comparative analysis of regional correlation, dynamic time warping, and skeletal tree matching for signature verification. IEEE Trans. Pattern Anal. Mach. Intell., 12(7):710-717, 1990.
29. G. Rote. Computing the Fréchet distance between piecewise smooth curves. Comput Geom. Theory Appl., 37(3):162-174, 2007.
30. Y. Wang. Exact algorithm for partial curve matching via the fréchet distance. Technical Report OSU-CISRC-9/08-TR48, The Ohio State University, 2008.
31. C. Wenk. Shape Matching in Higher Dimensions. PhD thesis, Dept. of Comput. Sci., Freie Universität, Berlin, 2002.