arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.05231cs.CGcs.DS
收藏

次二次时间内的Fréchet距离计算

Fréchet Distance in Subquadratic Time

Siu-Wing Cheng, Haoqiang Huang

AI总结:

本文针对两条多边形曲线Fréchet距离计算长期存在的二次时间障碍,提出首个在m = Ω(n^ε)条件下以o(mn)期望时间运行的算法,突破了近三十年的计算下界。

摘要:

设$m$和$n$分别为$\mathbb{R}^d$中两条多边形曲线的顶点数,其中$d$为任意固定维数,且满足$m \leq n$。自1995年已知如何在$O(mn\log (mn))$时间内计算这两条曲线的Fréchet距离以来,当$m = Ω(n)$时运行时间能否降至$o(n^2)$一直是一个悬而未决的问题。与此同时,计算几何中若干著名的二次时间障碍已被突破:3SUM、一些3SUM困难问题,以及两条多边形曲线之间若干距离的计算,包括离散Fréchet距离、动态时间规整距离和几何编辑距离。令人好奇的是,Fréchet距离的二次时间障碍仍然存在。我们提出一种算法,对于某个常数$μ\in (0,1)$,以$O(mn(\log\log n)^{2+μ}\log n/\log^{1+μ} m)$的期望时间计算Fréchet距离。这是第一个在$m = Ω(n^{\varepsilon})$(对任意固定的$\varepsilon \in (0,1]$)时以$o(mn)$时间返回Fréchet距离的算法。

英文摘要:

Let $m$ and $n$ be the numbers of vertices of two polygonal curves in $\mathbb{R}^d$ for any fixed $d$ such that $m \leq n$. Since it was known in 1995 how to compute the Fréchet distance of these two curves in $O(mn\log (mn))$ time, it has been an open problem whether the running time can be reduced to $o(n^2)$ when $m = Ω(n)$. In the mean time, several well-known quadratic time barriers in computational geometry have been overcome: 3SUM, some 3SUM-hard problems, and the computation of some distances between two polygonal curves, including the discrete Fréchet distance, the dynamic time warping distance, and the geometric edit distance. It is curious that the quadratic time barrier for Fréchet distance still stands. We present an algorithm to compute the Fréchet distance in $O(mn(\log\log n)^{2+μ}\log n/\log^{1+μ} m)$ expected time for some constant $μ\in (0,1)$. It is the first algorithm that returns the Fréchet distance in $o(mn)$ time when $m = Ω(n^{\varepsilon})$ for any fixed $\varepsilon \in (0,1]$.

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

↑