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

.

##
###
Approximating the integral Fréchet distance

2018
*
Computational geometry
*

We present a pseudo-polynomial time (1+ε)-approximation algorithm for computing the integral and average Fréchet distance between two given polygonal curves T 1 and T 2 . The running time is in O(ζ 4 n 4 /ε 2 ) where n is the complexity of T 1 and T 2 and ζ is the maximal ratio of the lengths of any pair of segments from T 1 and T 2 . Furthermore, we give relations between weighted shortest paths inside a single parameter cell C and the monotone free space axis of C. As a result we present a

doi:10.1016/j.comgeo.2018.01.001
fatcat:d6maaooh3vhcdlndokdr6hr5li