Jaywalking你的狗-计算Fréchet距离与快捷方式
Jaywalking your Dog - Computing the Fréchet Distance with Shortcuts
摘要:
两条多边形曲线的相似性可以用Fréchet距离来度量。我们引入了一个更强大的Fréchet距离的概念,其中一个是允许捷径的顶点之间的曲线之一。这是处理噪声的自然方法,特别是批量离群值。我们计算一个(3+ \eps)-近似的最小Fréchet距离在所有可能的这样的捷径,在近线性时间,如果曲线是c-包装和捷径的数量是小的或无界的。为了方便新的算法,我们开发了几个新的工具:(A)一个数据结构,用于预处理曲线(不一定是c-包装),支持(1+ \eps)-近似Fréchet距离查询之间的子曲线(原始曲线)和线段。(B)一种近似线性时间算法,计算曲线顶点的置换,使得该置换的任何2k-1个顶点的前缀与任何具有k个顶点的多边形曲线相比形成原始曲线的最佳近似(直到常数因子),对于任何k > 0。(C)一种用于预处理曲线的数据结构,其支持子曲线与查询多边形曲线之间的近似Fréchet距离查询。查询时间二次依赖于查询曲线的复杂度,并且仅(粗略地)依赖于原始曲线的复杂度。据我们所知,这些是第一个有效支持这类查询的数据结构。
英文摘要:
The similarity of two polygonal curves can be measured using the Fréchet distance. We introduce the notion of a more robust Fréchet distance, where one is allowed to shortcut between vertices of one of the curves. This is a natural approach for handling noise, in particular batched outliers. We compute a (3+\eps)-approximation to the minimum Fréchet distance over all possible such shortcuts, in near linear time, if the curve is c-packed and the number of shortcuts is either small or unbounded. To facilitate the new algorithm we develop several new tools: (A) A data structure for preprocessing a curve (not necessarily c-packed) that supports (1+\eps)-approximate Fréchet distance queries between a subcurve (of the original curve) and a line segment. (B) A near linear time algorithm that computes a permutation of the vertices of a curve, such that any prefix of 2k-1 vertices of this permutation, form an optimal approximation (up to a constant factor) to the original curve compared to any polygonal curve with k vertices, for any k > 0. (C) A data structure for preprocessing a curve that supports approximate Fréchet distance queries between a subcurve and query polygonal curve. The query time depends quadratically on the complexity of the query curve, and only (roughly) logarithmically on the complexity of the original curve. To our knowledge, these are the first data structures to support these kind of queries efficiently.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。