Computing the Fréchet distance with shortcuts is NP-hard
DOI10.1145/2582112.2582144zbMATH Open1395.68292arXiv1307.2097OpenAlexW2138661093WikidataQ130995449 ScholiaQ130995449MaRDI QIDQ4635561FDOQ4635561
Maike Buchin, Anne Driemel, Bettina Speckmann
Publication date: 23 April 2018
Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.2097
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (6)
- Fréchet Distance for Uncertain Curves
- Similarity of polygonal curves in the presence of outliers
- How to walk your dog in the mountains with no magic leash
- Computing the Fréchet gap distance
- SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
- Title not available (Why is that?)
This page was built for publication: Computing the Fréchet distance with shortcuts is NP-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635561)