Minimizing walking length in map matching

DOI10.1007/978-3-319-28678-5_8MaRDI QIDQ2798023zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Approximate Map Matching with respect to the Fréchet Distance
• scientific article; zbMATH DE number 2079389
• Matching planar maps
• Improved algorithms for partial curve matching
• Improved algorithms for partial curve matching

Cited in

(4)

• Optimal on-line algorithms for walking with minimum number of turns in unknown streets
• Weighted minimum backward Fréchet distance
• Algorithms for matching and predicting trajectories
• Fast map matching with vertex-monotone Fréchet distance

This page was built for publication: Minimizing walking length in map matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798023)