Loading...

Improved algorithms for partial Curve matching

Maheshwari, A ; Sharif University of Technology | 2011

755 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-23719-5_44
  3. Publisher: 2011
  4. Abstract:
  5. Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fréchet distance, achieving a running time of O(nm log(nm)), for n and m being the number of segments in the two curves, respectively. We improve this long-standing result by presenting an algorithm that solves this decision problem in O(nm) time. Our solution is based on constructing a simple data structure which we call free-space map. Using this data structure, we obtain improved algorithms for several variants of the Fréchet distance problem, including the Fréchet distance between two closed curves, and the so-called minimum/maximum walk problems. We also improve the map matching algorithm of Alt et al. for the case when the map is a directed acyclic graph
  6. Keywords:
  7. Closed curve ; Curve matching ; Decision problems ; Directed acyclic graphs ; Efficient algorithm ; Free space ; Improved algorithm ; Map-matching algorithm ; Running time ; Algorithms ; Data structures ; Image matching
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5 September 2011 through 9 September 2011 ; Volume 6942 LNCS , September , 2011 , Pages 518-529 ; 03029743 (ISSN) ; 9783642237188 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-23719-5_44