Locally Correct Fréchet Matchings [chapter]

Kevin Buchin, Maike Buchin, Wouter Meulemans, Bettina Speckmann
2012 Lecture Notes in Computer Science  
The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fréchet matchings to "natural" matchings and to this end introduce locally correct Fréchet matchings. We prove that at least one such matching exists for
more » ... wo polygonal curves and give an O(N 3 log N ) algorithm to compute it, where N is the total number of edges in both curves. We also present an O(N 2 ) algorithm to compute a locally correct discrete Fréchet matching.
doi:10.1007/978-3-642-33090-2_21 fatcat:h2jnvjcmf5hbvgesbhqt6hbi4e