不平衡情况下弗雷歇距离
Fréchet Distance in the Imbalanced Case
AI总结:
研究证明了在不平衡情况下,1D离散弗雷歇距离无法在特定时间内近似,同时提出了适用于任意维度和L_p空间的近似算法。
摘要:
给定由n个和m个顶点定义的两个多边形曲线P和Q,其中m≤n,我们证明在1D情况下,离散弗雷歇距离无法在O((nm)^{1-δ})时间内以因子2-ε进行近似,除非OVH不成立。使用类似的构造,我们扩展了在2D曲线下的连续或离散弗雷歇距离的界限,并将近似因子增加到1+√2-ε(resp. 3-ε)如果曲线位于欧几里得空间(resp. 在L∞空间中)。这加强了Buchin、Ophelders和Speckmann的下界到m=n^α的情况,其中α∈(0,1),并提高了Bringmann的近似因子1.001。对于1D情况下的离散弗雷歇距离,我们提供了一个具有最优近似因子和几乎最优运行时间的近似算法。此外,对于任何维度嵌入在任何L_p空间中的曲线,我们提出了一个使用O((n+m^2)logn)时间的(3+ε)-近似算法,几乎匹配了L∞度量的下界近似因子。
英文摘要:
Given two polygonal curves $P$ and $Q$ defined by $n$ and $m$ vertices with $m\leq n$, we show that the discrete Fréchet distance in 1D cannot be approximated within a factor of $2-\varepsilon$ in $\mathcal{O}((nm)^{1-δ})$ time for any $\varepsilon, δ>0$ unless OVH fails. Using a similar construction, we extend this bound for curves in 2D under the continuous or discrete Fréchet distance and increase the approximation factor to $1+\sqrt{2}-\varepsilon$ (resp. $3-\varepsilon$) if the curves lie in the Euclidean space (resp. in the $L_\infty$-space). This strengthens the lower bound by Buchin, Ophelders, and Speckmann to the case where $m=n^α$ for $α\in(0,1)$ and increases the approximation factor of $1.001$ by Bringmann. For the discrete Fréchet distance in 1D, we provide an approximation algorithm with optimal approximation factor and almost optimal running time. Further, for curves in any dimension embedded in any $L_p$ space, we present a $(3+\varepsilon)$-approximation algorithm for the continuous and discrete Fréchet distance using $\mathcal{O}((n+m^2)\log n)$ time, which almost matches the approximation factor of the lower bound for the $L_\infty$ metric.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。