The k-outlier Fr\'echet distance

TL;DR

This paper introduces two variants of the Fréchet distance to address its bottleneck issue, along with an efficient algorithm for computing these new measures, expanding the scope of shortcut Fréchet distances.

Contribution

The paper proposes novel variants of the Fréchet distance and provides an efficient algorithm for their computation, enhancing its applicability.

Findings

Two new variants of the Fréchet distance are introduced.

An efficient algorithm for computing the new distances is developed.

The work extends the concept of shortcut Fréchet distances.

Abstract

The Fr\'echet distance is a popular metric for curves; however, its bottleneck character is a disadvantage in many applications. Here we introduce two variants of the Fr\'echet distance to cope with this problem and expand the work on shortcut Fr\'echet distances. We present an efficient algorithm for computing the new distance measure.