Approximate Map Matching with respect to the Fréchet Distance
From MaRDI portal
Publication:5233699
DOI10.1137/1.9781611972917.8zbMath1430.68366OpenAlexW2403500509MaRDI QIDQ5233699
No author found.
Publication date: 12 September 2019
Published in: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/01920c8489233e2be207822eb6b8f7b571953e45
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (8)
Computing the Fréchet Distance Between Polygons with Holes ⋮ Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds ⋮ Approximating the Packedness of Polygonal Curves ⋮ Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance ⋮ Skeleton-Based Recognition of Shapes in Images via Longest Path Matching ⋮ Approximating the packedness of polygonal curves ⋮ Unnamed Item ⋮ Fast algorithms for approximate Fréchet matching queries in geometric trees
This page was built for publication: Approximate Map Matching with respect to the Fréchet Distance
