SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
From MaRDI portal
Publication:5236371
DOI10.1137/1.9781611975482.179zbMath1432.68501arXiv1807.08699OpenAlexW2962927274MaRDI QIDQ5236371
Tim Ophelders, Kevin Buchin, Bettina Speckmann
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.08699
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Fréchet Distance for Uncertain Curves ⋮ When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Fine-grained complexity theory: conditional lower bounds for computational geometry
This page was built for publication: SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
