arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.4859cs.CGcs.CC
收藏

基于Fréchet距离的曲线到不精确点集的匹配

Matching Curves to Imprecise Point Sets using Fréchet Distance

Paul Accisano, Alper Üngör

摘要:

设$P$是$\mathbb{R}^d$中长度为$n$的多边形曲线,而$S$是大小为$k$的点集。曲线/点集匹配问题包括在$S$上找到一条多边形曲线$Q$,使得到$P$的Fréchet距离小于给定的$\varepsilon$。我们考虑八个变化的问题的基础上使用的距离度量和可省略性或重复性的点。我们提供了封闭的情况下,$S$由精确的点的复杂性结果最近的一系列。更重要的是,我们制定了一个更现实的版本的问题,考虑到测量误差。这个新的问题被提出作为一个给定的曲线的一组不精确的点的匹配。我们证明,所有三个变化的问题,在P时,$S$由精确点成为NP-完全时,$S$由不精确点。我们还讨论了近似结果。

英文摘要:

Let $P$ be a polygonal curve in $\mathbb{R}^d$ of length $n$, and $S$ be a point-set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that the Fréchet distance from $P$ is less than a given $\varepsilon$. We consider eight variations of the problem based on the distance metric used and the omittability or repeatability of the points. We provide closure to a recent series of complexity results for the case where $S$ consists of precise points. More importantly, we formulate a more realistic version of the problem that takes into account measurement errors. This new problem is posed as the matching of a given curve to a set of imprecise points. We prove that all three variations of the problem that are in P when $S$ consists of precise points become NP-complete when $S$ consists of imprecise points. We also discuss approximation results.

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

↑