A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

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

2017
*
Discrete & Computational Geometry
*

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 n) 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 Alt to conjecture

doi:10.1007/s00454-017-9878-7
fatcat:6wvkfpfqlbfzfhfxidrmdi3d44