Comparison of distance measures for planar curves

DOI10.1007/s00453-003-1042-5zbMath1072.68105OpenAlexW2083244827MaRDI QIDQ1889583

Helmut Alt, Christian Knauer, Carola Wenk

Publication date: 2 December 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1042-5

zbMATH Keywords

Hausdorff distanceFréchet distance

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (18)

Optimizing the geometrical accuracy of curvilinear meshes ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Implicitization of curves and (hyper)surfaces using predicted support ⋮ Unnamed Item ⋮ Computing the Fréchet distance between folded polygons ⋮ 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 ⋮ Computing the Fréchet distance between simple polygons ⋮ Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ Approximating the Packedness of Polygonal Curves ⋮ COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT ⋮ Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D ⋮ Fast Fréchet Distance Between Curves with Long Edges ⋮ DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES ⋮ Approximating the packedness of polygonal curves ⋮ Fast algorithms for approximate Fréchet matching queries in geometric trees

This page was built for publication: Comparison of distance measures for planar curves