When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
type: Item
instance of: scholarly article
author: Karl Bringmann
author: Marvin Künnemann
author: André Nusser
publication date: 2023-02-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/2008.07510
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7651164
zbMATH Keywords: Fréchet distance
zbMATH Keywords: computational geometry
zbMATH Keywords: continuous optimization
zbMATH Keywords: algorithm engineering
describes a project that uses: 2D Arrangement
describes a project that uses: CGAL
MaRDI profile type: Publication
OpenAlex ID: W3082387026
title: When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
cites work: Computing the Discrete Fréchet Distance in Subquadratic Time
cites work: COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
cites work: Q2762787
cites work: The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
cites work: Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
cites work: Four Soviets walk the dog: improved bounds for computing the Fréchet distance
cites work: Q4633876
cites work: SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
cites work: FRESH: Fréchet similarity with hashing
cites work: Approximating the Fréchet distance for realistic curves in near linear time
cites work: Distance measures for point sets and their computation
cites work: The cubic algorithm
cites work: Two alternatives for the cubic algorithm
cites work: Precision, complexity, and computational schemes of the cubic algorithms
cites work: The fast cubic algorithm
cites work: Q4833810
cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
cites work: On the convergence of global methods in multiextremal optimization
cites work: Q4889854
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Approximately matching polygonal curves with respect to the Fréchet distance
cites work: An algorithm for finding the absolute extremum of a function
cites work: Q3024812
cites work: Q4254875
DOI: 10.4230/LIPICS.ESA.2020.25
description: scientific article; zbMATH DE number 7651164