arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.2827cs.CG
收藏

具有简单性约束的地图匹配

Map Matching with Simplicity Constraints

Wouter Meulemans

摘要:

我们研究了一个地图匹配问题,即在嵌入图中找到一条到R^2中给定曲线的距离较短的路径。Fréchet距离是这个问题的常用度量。存在有效的方法来根据该度量计算最佳路径。然而,即使给定的曲线是简单的,这些方法也不能保证结果是简单的(即它本身不相交)。本文证明了:对于一个到给定简单闭曲线至多有给定Fréchet距离的图,判定其平面直线嵌入中存在简单圈的问题实际上是NP-完全的.我们还考虑了我们的一些变种的问题证明的影响。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑