Algorithms for the discrete Fréchet distance under translation
From MaRDI portal
Publication:5120149
Recommendations
- scientific article; zbMATH DE number 7238975
- Fréchet distance under translation: conditional hardness and an algorithm via offline dynamic grid reachability
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
- The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Cited in
(13)- Translation invariant Fréchet distance queries
- Approximate nearest neighbor for curves: simple, efficient, and deterministic
- The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances
- Discrete Fréchet Distance under Translation
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
- scientific article; zbMATH DE number 7238975 (Why is no real title available?)
- Fréchet distance under translation: conditional hardness and an algorithm via offline dynamic grid reachability
- Adaptive computation of the discrete Fréchet distance
- Fréchet edit distance
- Fine-grained complexity of Earth mover's distance under translation
- Transforming dogs on the line: on the Fréchet distance under translation or scaling in 1D
- ANN for time series under the Fréchet distance
This page was built for publication: Algorithms for the discrete Fréchet distance under translation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120149)