Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution)
نویسندگان
چکیده
By folding the free-space diagram for efficient preprocessing, we show that the Fréchet distance between 1D curves can be computed in O(nk logn) time, assuming one curve has ply k. 1998 ACM Subject Classification F.2.2 [Nonnumerical Algorithms and Problems] Geometrical Problems and Computations
منابع مشابه
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...
متن کاملFréchet Distance for Curves, Revisited
We revisit the problem of computing the Fréchet distance between polygonal curves, focusing on the discrete Fréchet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo–output-s...
متن کاملComputing the Fréchet Distance Between Polygons with Holes
We study the problem of computing the Fréchet distance between subsets of Euclidean space. Even though the problem has been studied extensively for 1-dimensional curves, very little is known for d-dimensional spaces, for any d ≥ 2. For general polygons in R, it has been shown to be NP-hard, and the best known polynomial-time algorithm works only for polygons with at most a single puncture [Buch...
متن کاملComputing Discrete Fréchet Distance
The Fréchet distance between two curves in a metric space is a measure of the similarity between the curves. We present a discrete variation of this measure. It provides good approximations of the continuous measure and can be efficiently computed using a simple algorithm. We also consider variants of discrete Fréchet distance, and find an interesting connection to measuring distance between th...
متن کاملMin-Link Shortest Path Maps and Fréchet Distance
We present shortest path maps that support min-link queries from any source point on a line segment to destination points in either a simple polygon or a polygonal domain (a polygon with holes). These structures are more versatile than the traditional shortest path map from a fixed source point, and we use them to compute the min-link Fréchet distance between two polygonal curves. In addition t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017