Fréchet Distance for Curves, Revisited

DOI10.1007/11841036_8zbMath1131.68561arXiv1504.07685OpenAlexW2153708898WikidataQ61632359 ScholiaQ61632359MaRDI QIDQ5449516

Yusu Wang, Christian Knauer, Carola Wenk, Boris Aronov, Sariel Har-Peled

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.07685

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (19)

Computing the similarity between moving curves ⋮ Computing the Fréchet Distance Between Polygons with Holes ⋮ A comprehensive study of clustering a class of 2D shapes ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Unnamed Item ⋮ Link distance and shortest path problems in the plane ⋮ Fast Fréchet queries ⋮ Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds ⋮ Approximating the Fréchet distance for realistic curves in near linear time ⋮ Unnamed Item ⋮ Shortest path problems on a polyhedral surface ⋮ Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ A sequential algorithm for recognition of a developing pattern with application in orthotic engineering ⋮ Approximating the Packedness of Polygonal Curves ⋮ Fréchet distance between a line and avatar point set ⋮ Fast Fréchet Distance Between Curves with Long Edges ⋮ Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time ⋮ Integrated shape-sensitive functional metrics ⋮ Approximating the packedness of polygonal curves

This page was built for publication: Fréchet Distance for Curves, Revisited