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

为离散与连续Fréchet距离削去两个对数因子

Shaving Two Logs for Discrete and Continuous Fréchet Distance

Siebel School of Computing and Data Science, University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校赛贝尔计算与数据科学学院);Department of Computer Science, University of California, Santa Barbara(加州大学圣塔芭芭拉分校计算机科学系)

Timothy M Chan, Isaac M Hair

AI总结:

该研究针对离散与连续Fréchet距离问题,提出了三种改进时间复杂度的确定性或随机算法,达到了当前技术水平的自然极限。

摘要:

我们重新研究经典计算几何问题:计算给定的两条各含n个顶点、处于常数维度d的多边形曲线之间的精确离散或连续Fréchet距离。1. 针对离散Fréchet距离问题,我们提出了时间复杂度为O((n²/log²n)log²logn)的确定性算法,改进了Agarwal、Ben Avraham、Kaplan和Sharir[SODA'13]提出的此前O((n²/logn)loglogn)的结果。2. 针对连续Fréchet距离问题的判定版本,我们提出了时间复杂度为O((n²/log²n)log²logn)的确定性算法,改进了Buchin、Buchin、Meulemans和Mulzer[SODA'14]提出的此前O((n²/logn)log²logn)的结果,以及Cheng和Huang[SODA'25]提出的针对小的未指定常数μ>0(μ随d增大收敛到0)的近期O(n²/log^(1+μ)n)随机结果。3. 最后,针对连续Fréchet距离问题,我们提出了时间复杂度为O((n²/log²n)log^(O(1))logn)的Las Vegas随机算法,改进了Buchin、Buchin、Meulemans和Mulzer[SODA'14]提出的此前O(n²log²logn)的随机结果,以及Cheng和Huang[SODA'25]声称的近期O(n²/log^μn)时间随机结果。由于这些问题具有基于OV的近二次条件下界,且削去两个对数因子是最长公共子序列、编辑距离等类似更简单问题的已知最优进展,我们的结果达到了当前技术水平的自然极限(仅保留loglog因子)。

英文摘要:

We revisit the classical computational geometry problem of computing the exact (discrete or continuous) Fréchet distance between two given polygonal curves with $n$ vertices in a constant dimension $d$. 1. We present an $O((n^2/\log^2n)\log^2\log n)$-time deterministic algorithm for the discrete Fréchet distance problem, improving the previous $O((n^2/\log n)\log\log n)$ result by Agarwal, Ben Avraham, Kaplan, and Sharir [SODA'13]. 2. We present an $O((n^2/\log^2n)\log^2\log n)$-time deterministic algorithm for the decision version of the continuous Fréchet distance problem, improving the previous $O((n^2/\log n)\log^2\log n)$ result by Buchin, Buchin, Meulemans, and Mulzer [SODA'14] and the recent $O(n^2/\log^{1+μ}n)$ randomized result by Cheng and Huang [SODA'25] for a small unspecified constant $μ>0$ (which converges to 0 as $d$ increases). 3. Finally, we present an $O((n^2/\log^2 n)\log^{O(1)}\log n)$-time Las Vegas randomized algorithm for the continuous Fréchet distance problem, improving the previous $O(n^2\log^2\log n)$ randomized result by Buchin, Buchin, Meulemans, and Mulzer [SODA'14] and the recent $O(n^2/\log^μn)$-time randomized result claimed by Cheng and Huang [SODA'25]. Since these problems have near-quadratic OV-based conditional lower bounds and shaving of two log factors is the best that is known for similar, simpler problems such as longest common subsequence and edit distance, our results reach the natural limit of the current state of the art (up to $\log\log$ factors).

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

↑