Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
From MaRDI portal
Publication:5088944
DOI10.4230/LIPIcs.SoCG.2019.17OpenAlexW2907168943MaRDI QIDQ5088944
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
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Cites Work
- Unnamed Item
- Following a curve with the discrete Fréchet distance
- Approximating the Fréchet distance for realistic curves in near linear time
- Certifying algorithms
- Distance measures for point sets and their computation
- FRESH: Fréchet similarity with hashing
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Approximability of the discrete Fréchet distance
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Approximate Map Matching with respect to the Fréchet Distance
- Approximating (k, ℓ)-center clustering for curves
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Computing the Discrete Fréchet Distance in Subquadratic Time
This page was built for publication: Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
