Page
%P
-
Chapter and Conference Paper
Minimizing Walking Length in Map Matching
In this paper, we propose a geometric algorithm for a map matching problem. More specifically, we are given a planar graph, H, with a straight-line embedding in a plane, a directed polygonal curve, T, and a dista...