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

DOI10.1137/1.9781611977554.CH53MaRDI QIDQ6538581zbMATH OpenFDO

Authors Joachim Gudmundsson, Martin P. Seybold, Sampson Wong

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH53

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Approximate Map Matching with respect to the Fréchet Distance
• Fast map matching with vertex-monotone Fréchet distance
• On the discrete Fréchet distance in a graph
• On the discrete Fréchet distance in a graph

Cited in

(8)

• Fast map matching with vertex-monotone Fréchet distance
• Approximating the -low-density value
• Map-matching queries under Fréchet distance on low-density spanners
• Discrete Fréchet distance oracles
• Computing a subtrajectory cluster from c-packed trajectories
• Data structures for approximate Fréchet distance for realistic curves
• A WSPD, separator and small tree cover for c-packed graphs
• Faster Fréchet distance under transformations

This page was built for publication: Map matching queries on realistic input graphs under the Fréchet distance

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