Skip to main content

and
  1. 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...

    Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack in Topics in Theoretical Computer Science (2016)