Fréchet Distance in the Imbalanced Case

Given two polygonal curves P and Q defined by n and m vertices with m ≤ n, we show that the discrete Fréchet distance in 1D cannot be approximated within a factor of 2-ε in 𝒪 ( (nm) ^1-δ) time for any ε, δ > 0 unless OVH fails. Using a similar construction, we extend this bound for curves in 2D under the continuous or discrete Fréchet distance and increase the approximation factor to 1+√2-ε (resp. 3-ε) if the curves lie in the Euclidean space (resp. in the L_∞-space). This strengthens the lower bound by Buchin, Ophelders, and Speckmann to the case where m = n^α for α ∈ (0, 1) and increases the approximation factor of 1. 001 by Bringmann. For the discrete Fréchet distance in 1D, we provide an approximation algorithm with optimal approximation factor and almost optimal running time. Further, for curves in any dimension embedded in any Lₚ space, we present a (3+ε) -approximation algorithm for the continuous and discrete Fréchet distance using 𝒪 ( (n+m²) log n) time, which almost matches the approximation factor of the lower bound for the L_∞ metric.