Approximability of the discrete Fréchet distance
From MaRDI portal
Publication:2970465
DOI10.20382/jocg.v7i2a4zbMath1405.68406OpenAlexW2256871140MaRDI QIDQ2970465
Wolfgang Mulzer, Karl Bringmann
Publication date: 30 March 2017
Full work available at URL: https://page.mi.fu-berlin.de/mulzer/pubs/frapproxSoCG.pdf
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (12)
ANN for time series under the Fréchet distance ⋮ Computing the Fréchet distance with a retractable leash ⋮ An improved approximation algorithm for the discrete Fréchet distance ⋮ Approximating the geometric edit distance ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Fast Fréchet Distance Between Curves with Long Edges ⋮ The Orthogonal Vectors Conjecture for Branching Programs and Formulas ⋮ Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation ⋮ Fine-grained complexity theory: conditional lower bounds for computational geometry
This page was built for publication: Approximability of the discrete Fréchet distance
