When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
From MaRDI portal
Publication:5874493
DOI10.4230/LIPIcs.ESA.2020.25OpenAlexW3082387026MaRDI QIDQ5874493
Karl Bringmann, Marvin Künnemann, André Nusser
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2008.07510
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the Fréchet distance for realistic curves in near linear time
- Approximately matching polygonal curves with respect to the Fréchet distance
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- The cubic algorithm
- On the convergence of global methods in multiextremal optimization
- Precision, complexity, and computational schemes of the cubic algorithms
- Two alternatives for the cubic algorithm
- The fast cubic algorithm
- 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
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- An algorithm for finding the absolute extremum of a function
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
- SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
- Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
- Computing the Discrete Fréchet Distance in Subquadratic Time
This page was built for publication: When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
