Fast map matching with vertex-monotone Fréchet distance

DOI10.4230/OASICS.ATMOS.2021.10MaRDI QIDQ6587286zbMATH OpenFDO

Authors Daniel I-Li Chen, C. Sommer, Daniel Wolleb

Publication date 13 August 2024

zbMATH Keywords

map matchingFréchet distanceminimum bottleneck path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Approximate Map Matching with respect to the Fréchet Distance
• Map matching queries on realistic input graphs under the Fréchet distance
• Minimizing walking length in map matching
• Improved algorithms for partial curve matching

Cited in

(1)

• Map matching queries on realistic input graphs under the Fréchet distance

This page was built for publication: Fast map matching with vertex-monotone Fréchet distance

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