When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation

08/17/2020
by   Karl Bringmann, et al.
0

Consider the natural question of how to measure the similarity of curves in the plane by a quantity that is invariant under translations of the curves. Such a measure is justified whenever we aim to quantify the similarity of the curves' shapes rather than their positioning in the plane, e.g., to compare the similarity of handwritten characters. Perhaps the most natural such notion is the (discrete) Fréchet distance under translation. Unfortunately, the algorithmic literature on this problem yields a very pessimistic view: On polygonal curves with n vertices, the fastest algorithm runs in time O(n^4.667) and cannot be improved below n^4-o(1) unless the Strong Exponential Time Hypothesis fails. Can we still obtain an implementation that is efficient on realistic datasets? Spurred by the surprising performance of recent implementations for the Fréchet distance, we perform algorithm engineering for the Fréchet distance under translation. Our solution combines fast, but inexact tools from continuous optimization (specifically, branch-and-bound algorithms for global Lipschitz optimization) with exact, but expensive algorithms from computational geometry (specifically, problem-specific algorithms based on an arrangement construction). We combine these two ingredients to obtain an exact decision algorithm for the Fréchet distance under translation. For the related task of computing the distance value up to a desired precision, we engineer and compare different methods. On a benchmark set involving handwritten characters and route trajectories, our implementation answers a typical query for either task in the range of a few milliseconds up to a second on standard desktop hardware. We believe that our implementation will enable the use of the Fréchet distance under translation in applications, whereas previous approaches would have been computationally infeasible.

READ FULL TEXT

page 6

page 7

page 22

page 23

research
01/06/2019

Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance

The Fréchet distance provides a natural and intuitive measure for the po...
research
02/11/2021

Translation Invariant Fréchet Distance Queries

The Fréchet distance is a popular similarity measure between curves. For...
research
07/14/2015

Closed Curves and Elementary Visual Object Identification

For two closed curves on a plane (discrete version) and local criteria f...
research
03/15/2022

Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves

The Dynamic Time Warping (DTW) distance is a popular measure of similari...
research
10/25/2018

Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability

The discrete Fréchet distance is a popular measure for comparing polygon...
research
06/04/2018

Adaptive Computation of the Discrete Fréchet Distance

The discrete Fréchet distance is a measure of similarity between point s...
research
10/09/2014

Computing minimum area homologies

Calculating and categorizing the similarity of curves is a fundamental p...

Please sign up or login with your details

Forgot password? Click here to reset