Paper detail

Map Matching with Simplicity Constraints

We study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fréchet distance is a common measure for this problem. Efficient methods exist to compute the best path according to this measure. However, these methods cannot guarantee that the result is simple (i.e. it does not intersect itself) even if the given curve is simple. In this paper, we prove that it is in fact NP-complete to determine the existence a simple cycle in a planar straight-line embedding of a graph that has at most a given Fréchet distance to a given simple closed curve. We also consider the implications of our proof on some variants of the problem.