• Corpus ID: 231879717

Translation Invariant Fr\'echet Distance Queries

@inproceedings{Gudmundsson2021TranslationIF,
  title={Translation Invariant Fr\'echet Distance Queries},
  author={Joachim Gudmundsson and Andr{\'e} van Renssen and Zeinab Saeidi and Sampson Wong},
  year={2021}
}
The Fréchet distance is a popular similarity measure between curves. For some applications, it is desirable to match the curves under translation before computing the Fréchet distance between them. This variant is called the Translation Invariant Fréchet distance, and algorithms to compute it are well studied. The query version, however, is much less well understood. We study Translation Invariant Fréchet distance queries in a restricted setting of horizontal query segments. More specifically… 

References

SHOWING 1-10 OF 27 REFERENCES

Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails

  • K. Bringmann
  • Computer Science, Mathematics
    2014 IEEE 55th Annual Symposium on Foundations of Computer Science
  • 2014
TLDR
It is shown that the Fréchet distance cannot be computed in strongly subquadratic time, i.e., in time O(n2-δ) for any delta > 0.001-approximation, which means that finding faster algorithms is as hard as finding faster CNF-SAT algorithms, and the existence of a strongly subaquadratic algorithm can be considered unlikely.

Fast fréchet distance between curves with long edges

TLDR
It is shown that for curves with long edges the Fréchet distance computations become easier, and three main results are proved for the case when all edges of both curves are long compared to the FrÉchet distance.

Data Structures for Fréchet Queries in Trajectory Data

TLDR
This work shows how to preprocess π into a data structure such that for any horizontal query segment σ in the plane and a subtrajectory between two vertices of π, one can quickly determine the Frechet distance between σ and that subtraJECTory.

Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts

TLDR
The notion of a more robust Frechet distance, where one is allowed to shortcut between vertices of one of the curves, is introduced, which is a natural approach for handling noise, in particular batched outliers.

Computing the Fréchet distance between two polygonal curves

  • H. AltM. Godau
  • Computer Science, Mathematics
    Int. J. Comput. Geom. Appl.
  • 1995
As a measure for the resemblance of curves in arbitrary dimensions we consider the so-called Frechet-distance, which is compatible with parametrizations of the curves. For polygonal chains P and Q

Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance

TLDR
This work gives a randomized algorithm to compute the Fréchet distance between two polygonal curves in time and shows that there exists an algebraic decision tree for the decision problem of depth, for some varepsilon > 0, which reveals an intriguing new aspect of this well-studied problem.

Matching Polygonal Curves with Respect to the Fréchet Distance

TLDR
A new reference point is given that is substantially better than all known reference points for the Hausdorff distance and yields a (1 + Ɛ)-approximation algorithm for the matching problem that has runtime O(Ɛ-2mn).

Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds

TLDR
This paper presents an improved algorithm with time complexity Open image in new window that improves upon the algorithm by Driemel et al. and matches the conditional lower bound (up to lower order factors of the form \(n^{o(1)}\)).

Fast algorithms for approximate Fréchet matching queries in geometric trees

Fréchet Distance Based Approach for Searching Online Handwritten Documents

TLDR
A novel, language-neutral approach for searching online handwritten text using Frechet distance that can be used for retrieving words even when only a prefix of the word is given as query, and outperforms the state-of-the-art DTW method.