On flipping the Fréchet distance

DOI10.1007/S00453-024-01267-8MaRDI QIDQ6647773zbMATH OpenFDO

Authors Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk

Publication date 3 December 2024

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-024-01267-8

zbMATH Keywords

conditional lower boundsFréchet distancemotion planningsocial distancing

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• Approximability of the discrete Fréchet distance
• Approximation of geometric dispersion problems
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Computing the geodesic center of a simple polygon
• Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
• Geodesic Fréchet distance inside a simple polygon
• Maximum dispersion and geometric maximum weight cliques
• Maximum thick paths in static and dynamic environments
• On flipping the Fréchet distance
• Optimal shortest path queries in a simple polygon
• SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
• Train scheduling: hardness and algorithms

This page was built for publication: On flipping the Fréchet distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647773)