Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
From MaRDI portal
Publication:5088944
Recommendations
- Walking the dog fast in practice: algorithm engineering of the Fréchet distance
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- scientific article; zbMATH DE number 7650283
- Computing the Fréchet distance with a retractable leash
- Computing the Fréchet distance with a retractable leash
- Algorithms for the discrete Fréchet distance under translation
- scientific article; zbMATH DE number 7238975
Cites work
- scientific article; zbMATH DE number 7051233 (Why is no real title available?)
- Approximability of the discrete Fréchet distance
- Approximate Map Matching with respect to the Fréchet Distance
- Approximating \((k,\ell)\)-center clustering for curves
- Approximating the Fréchet distance for realistic curves in near linear time
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Certifying algorithms
- Distance measures for point sets and their computation
- FRESH: Fréchet similarity with hashing
- Following a curve with the discrete Fréchet distance
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
Cited in
(3)
This page was built for publication: Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088944)