Matching Polygonal Curves with Respect to the Fréchet Distance
نویسندگان
چکیده
منابع مشابه
Approximately matching polygonal curves with respect to the Fre'chet distance
In this paper we present approximate algorithms for matching two polygonal curves with respect to the Fréchet distance. We define a discrete version of the Fréchet distance as a distance measure between polygonal curves and show that this discrete version is bounded by the continuous version of the Fréchet distance. For the task of matching with respect to the discrete Fréchet distance, we deve...
متن کاملLocally Correct Fréchet Matchings
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...
متن کاملPartial Curve Matching under the Fréchet Distance∗
Curve matching is a fundamental problem which occurs in many applications. In this paper, we extend the Fréchet distance to measure partial curve similarity, study its properties, and develop efficient algorithms to compute it. In particular, under the L1 or L∞ metrics, we present an algorithm to compute, in O(m2) time, the partial Fréchet distance between a segment and a polygonal curve of siz...
متن کاملApplied Similarity Problems Using Frechet Distance
The Fréchet distance is a well-known metric to measure similarity of polygonal curves. In the first part of this thesis, we introduce a new metric called Fréchet distance with speed limits and provide efficient algorithms for computing it. The classical Fréchet distance between two curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-n...
متن کاملProbabilistic matching of sets of polygonal curves∗
Analysis and comparison of geometric shapes are of importance in various application areas within computer science, e.g., pattern recognition and computer vision. The general situation in a shape matching problem is that we are given two shapes A and B and a certain class T of allowable transformations and we want to transform B optimally so that the transformed image of B is as close to A as p...
متن کامل