Computing the Fr\'echet distance with shortcuts is NP-hard
Abstract
We study the shortcut Fr\'echet distance, a natural variant of the Fr\'echet distance, that allows us to take shortcuts from and to any point along one of the curves. The classic Fr\'echet distance is a bottle-neck distance measure and hence quite sensitive to outliers. The shortcut Fr\'echet distance allows us to cut across outliers and hence produces significantly more meaningful results when dealing with real world data. Driemel and Har-Peled recently described approximation algorithms for the restricted case where shortcuts have to start and end at input vertices. We show that, in the general case, the problem of computing the shortcut Fr\'echet distance is NP-hard. This is the first hardness result for a variant of the Fr\'echet distance between two polygonal curves in the plane. We also present two algorithms for the decision problem: a 3-approximation algorithm for the general case and an exact algorithm for the vertex-restricted case. Both algorithms run in O(n3 log n) time.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.