On flipping the Fréchet distance

DOI10.1007/s00453-024-01267-8MaRDI QIDQ6647773

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

Publication date: 3 December 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

motion planningFréchet distancesocial distancingconditional lower bounds

Mathematics Subject Classification ID

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

Cites Work

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

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)