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.
Quasi-optimal range searching in spaces of finite vc-dimension
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 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.