Minimizing Walking Length in Map Matching

DOI10.1007/978-3-319-28678-5_8zbMath1474.68421OpenAlexW2395226356WikidataQ62037418 ScholiaQ62037418MaRDI QIDQ2798023

Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack

Publication date: 1 April 2016

Published in: Topics in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01446266/file/385217_1_En_8_Chapter.pdf

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Weighted minimum backward Fréchet distance

This page was built for publication: Minimizing Walking Length in Map Matching