# Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance

@article{Buchin2017FourSW, title={Four Soviets Walk the Dog: Improved Bounds for Computing the Fr{\'e}chet Distance}, author={Kevin Buchin and Maike Buchin and Wouter Meulemans and Wolfgang Mulzer}, journal={Discrete \& Computational Geometry}, year={2017}, volume={58}, pages={180-216} }

Given two polygonal curves in the plane, there are many ways to define a notion of similarity between them. One popular measure is the Fréchet distance. Since it was proposed by Alt and Godau in 1992, many variants and extensions have been studied. Nonetheless, even more than 20 years later, the original $$O(n^2 \log n)$$O(n2logn) algorithm by Alt and Godau for computing the Fréchet distance remains the state of the art (here, n denotes the number of edges on each curve). This has led Helmut…

## Figures, Tables, and Topics from this paper

## 29 Citations

When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation

- Computer Science, MathematicsESA
- 2020

The solution combines fast, but inexact tools from continuous optimization with exact, but expensive algorithms from computational geometry to obtain an exact decision algorithm for the Frechet distance under translation.

The k-Fréchet Distance: How to Walk Your Dog While Teleporting

- Mathematics, Computer ScienceISAAC
- 2019

A new distance measure for comparing polygonal chains: the k-Frechet distance, closely related to the well-studied Frechet distance but detects similarities between curves that resemble each other only piecewise.

The k-Fréchet distance

- Mathematics, Computer ScienceArXiv
- 2019

It is shown that deciding this distance measure turns out to be NP-complete, which is interesting since both (weak) Fréchet and Hausdorff distance are computable in polynomial time.

Approximating the (continuous) Fréchet distance

- Computer Science, MathematicsSoCG
- 2021

This work describes the first strongly subquadratic time algorithm with subexponential approximation ratio for approximately computing the Frechet distance between two polygonal chains, and describes how to turn any approximate decision procedure for theFrechet distance into an approximate optimization algorithm whose approximation ratio is the same up to arbitrarily small constant factors.

Computing the Fréchet Distance Between Uncertain Curves in One Dimension

- Computer ScienceWADS
- 2021

While finding the optimal placement of vertices seems more difficult than the regular Fréchet distance – and indeed it can easily prove that the problem is NP-hard in 2D – the optimal placed vertices in 1D can be computed in polynomial time.

Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance

- Computer ScienceSoCG
- 2019

A fast, certifying implementation for deciding the Fr\'echet distance is presented in order to complement its pessimistic worst-case hardness by an empirical analysis on realistic input data and to improve the state of the art for the GIS Cup challenge.

On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance

- Computer Science, MathematicsSoCG
- 2018

It is shown that computing an optimal simplification using the undirected Hausdorff distance is NP-hard, and how the well-known Douglas-Peucker and Imai-Iri simplification algorithms perform compared to the optimum possible is analyzed.

On the Discrete Fréchet Distance in a Graph

- Computer ScienceArXiv
- 2022

A conditional lower bound is provided showing that the Fréchet distance, or even its 1.01-approximation, between arbitrary paths in a weighted planar graph cannot be computed in O((|P | · |Q|)1−δ) time for any δ > 0 unless the Orthogonal Vector Hypothesis fails.

VARIANTS OF THE DISCRETE FRÉCHET DISTANCE UNDER TRANSLATION∗

- 2020

The (discrete) Fréchet distance (DFD) is a popular similarity measure for curves. Often the input curves are not aligned, so one of them must undergo some transformation for the distance computation…

Rock Climber Distance: Frogs versus Dogs

- Mathematics, Computer ScienceCCCG
- 2019

Two new distance measures are explored, called rock climber distance and $k-station distance, in which the agents move alternately in their coordinated motion that traverses the polygonal chains, and it is shown that it is NP-hard to determine the distance between two curves.

## References

SHOWING 1-10 OF 74 REFERENCES

Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails

- Mathematics, Computer Science2014 IEEE 55th Annual Symposium on Foundations of Computer Science
- 2014

It is shown that the Fréchet distance cannot be computed in strongly subquadratic time, i.e., in time O(n2-δ) for any delta > 0.001-approximation, which means that finding faster algorithms is as hard as finding faster CNF-SAT algorithms, and the existence of a strongly subaquadratic algorithm can be considered unlikely.

Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts

- Computer Science, MathematicsSIAM J. Comput.
- 2012

The notion of a more robust Frechet distance, where one is allowed to shortcut between vertices of one of the curves, is introduced, which is a natural approach for handling noise, in particular batched outliers.

Computing the Fréchet Distance with a Retractable Leash

- Computer Science, MathematicsDiscret. Comput. Geom.
- 2016

This work presents a novel approach that avoids the detour through the decision version of the Fréchet distance between polygonal curves and gives the first quadratic time algorithm.

Computing the Discrete Fréchet Distance in Subquadratic Time

- Mathematics, Computer ScienceSIAM J. Comput.
- 2014

This work presents the first subquadratic algorithm for computing the discrete Frechet distance between two sequences of points in the plane, and uses the geometry of the problem in a subtle way to encode legal positions of the frogs as states of a finite automaton.

Fréchet distance with speed limits

- Mathematics, Computer ScienceComput. Geom.
- 2011

An efficient algorithm is provided that decides in O(n^2logn) time whether the Frechet distance with speed limits between two polygonal curves is at most @e, where n is the number of segments in the curves, and @e>=0 is an input parameter.

How Difficult is it to Walk the Dog ?

- 2007

We study the complexity of computing the Fréchet distance (also called dog-leash distance) between two polygonal curves with a total number of n vertices. For two polygonal curves in the plane we…

Approximability of the Discrete Fréchet Distance

- Computer Science, MathematicsSoCG
- 2015

This paper designs an alpha-approximation algorithm that runs in time O(n log n + n^2 / alpha), for any alpha in [1, n], and presents the first such algorithm by analysing the approximation ratio of a simple, linear-time greedy algorithm to be 2^Theta(n).

The fréchet distance revisited and extended

- Mathematics, Computer ScienceTALG
- 2014

Given two simplicial complexes in Rd and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the weak Fréchet distance between…

Can We Compute the Similarity between Surfaces?

- Mathematics, Computer ScienceDiscret. Comput. Geom.
- 2010

It follows that the decision problem, whether the Fréchet distance of two given surfaces lies below a specified value, is recursively enumerable, and it is shown that a relaxed version of the FrÉchet distance, the weak Fréchechet distance can be computed in polynomial time.

Exact algorithms for partial curve matching via the Fréchet distance

- Computer Science, MathematicsSODA
- 2009

This paper presents the first exact algorithm that runs in polynomial time to compute fδ(P, Q), the partial Frechet similarity between P and Q, under the L1 and L∞ norms.