We present a linear-time algorithm to find, for a piece-wise monotone function, an interval of at least a given length that has minimum average value.Expand

We present 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.Expand

We show how to break the quadratic barrier for the discrete version of the Frechet distance, where one considers sequences of points instead of polygonal curves.Expand

We show how to leverage between the temporal and non-temporal approaches of curve analysis by extending a tool from curve analysis, namely the free space diagram.Expand

We present the first polynomial-time algorithm for computing the Frechet distance for a non-trivial class of surfaces: simple polygons, i.e., the area enclosed by closed simple polygonal curves, which may lie in different planes.Expand