Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
From MaRDI portal
Publication:5088944
DOI10.4230/LIPICS.SOCG.2019.17OpenAlexW2907168943MaRDI QIDQ5088944FDOQ5088944
Authors: Karl Bringmann, Marvin Künnemann, André Nusser
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2019.17
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
Analysis of algorithms (68W40) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Approximating \((k,\ell)\)-center clustering for curves
- Following a curve with the discrete Fréchet distance
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Approximability of the discrete Fréchet distance
- Approximating the Fréchet distance for realistic curves in near linear time
- Distance measures for point sets and their computation
- Certifying algorithms
- Title not available (Why is that?)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Approximate Map Matching with respect to the Fréchet Distance
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- FRESH: Fréchet similarity with hashing
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)