A continuous interval-sweep algorithm solves travel-time-constrained map matching on path graphs with a guarantee to find a feasible mapping whenever one exists, in near-linear to subquadratic time.
An introduction to map matching for personal navigation assistants
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Continuous Map Matching to Paths under Travel Time Constraints
A continuous interval-sweep algorithm solves travel-time-constrained map matching on path graphs with a guarantee to find a feasible mapping whenever one exists, in near-linear to subquadratic time.