基于离散Fréchet距离的间歇地图匹配
Intermittent Map Matching with the Discrete Fréchet Distance
摘要:
在本文中,我们专注于地图匹配问题的目标是找到一条路径,通过平面图,通过顶点的路径紧密匹配一个给定的多边形曲线。地图匹配问题通常也用匹配路径边缘的Fréchet距离来处理。在这里,我们正式定义的离散地图匹配问题的基础上离散Fréchet距离。然后,我们看看一些变化的问题,允许顶点在图中是唯一的或重用的复杂性,以及是否有一个约束的路径的长度或顶点的数量从图中使用的路径。我们证明了这些问题是NP-完全的,然后总结了一些悬而未决的问题的文件。
英文摘要:
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with the Fréchet distance matching the edges of the path as well. Here, we formally define the discrete map matching problem based on the discrete Fréchet distance. We then look at the complexities of some variations of the problem which allow for vertices in the graph to be unique or reused, and whether there is a bound on the length of the path or the number of vertices from the graph used in the path. We prove several of these problems to be NP-complete, and then conclude the paper with some open questions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。