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

关于图中的离散Fréchet距离

On the Discrete Fréchet Distance in a Graph

Anne Driemel, Ivor van der Hoog, Eva Rotenberg

AI总结:

本文研究了图上路径和游走的离散Fréchet距离,利用平面图结构和距离预言机提出了针对最短路径和近似最短路径的快速近似算法,并证明了次二次运行时间所需的条件下界。

摘要:

Fréchet距离是曲线之间一种被广泛研究的相似性度量,在整个计算机科学中被广泛使用。受曲线源于底层图(如道路网络)上的路径和游走的应用启发,我们定义并研究了图上路径和游走的Fréchet距离。当提供图$G$的查询时间为$O(1)$的距离预言机时,经典的二次时间动态规划能在$O(|P| \cdot |Q|)$时间内计算出图$G$中两条游走$P$和$Q$之间的Fréchet距离。我们证明,在某些情况下,图结构有助于计算Fréchet距离:当图$G$是平面图时,我们应用现有的(近似)距离预言机,在$O(|G| \log |G| / \sqrt{\varepsilon} + |P| + \frac{|Q|}{\varepsilon } )$时间内计算出任意最短路径$P$和任意游走$Q$之间Fréchet距离的$(1+\varepsilon)$-近似。我们将此结果推广到近似最短路径,即$κ$-直路径,展示了如何在$O(|G| \log |G| / \sqrt{\varepsilon} + |P| + \frac{κ|Q|}{\varepsilon } )$时间内计算出$κ$-直路径$P$和任意游走$Q$之间的$(1+\varepsilon)$-近似。我们的算法结果适用于$G$中最短路径度量下的强离散和弱离散Fréchet距离。最后,我们表明,对输入的额外假设(如我们对路径直度的假设)对于获得真正的次二次运行时间确实是必要的。我们提供了一个条件下界,证明除非正交向量假设失败,否则对于任意$\delta>0$,无法在$O((|P|\cdot|Q|)^{1-\delta})$时间内计算出加权平面图中任意\emph{路径}之间的Fréchet距离或其$1.01$-近似。对于游走,即使$G$是平面图、单位权重且仅有$O(1)$个顶点,该下界依然成立。

英文摘要:

The Fréchet distance is a well-studied similarity measure between curves that is widely used throughout computer science. Motivated by applications where curves stem from paths and walks on an underlying graph (such as a road network), we define and study the Fréchet distance for paths and walks on graphs. When provided with a distance oracle of $G$ with $O(1)$ query time, the classical quadratic-time dynamic program can compute the Fréchet distance between two walks $P$ and $Q$ in a graph $G$ in $O(|P| \cdot |Q|)$ time. We show that there are situations where the graph structure helps with computing Fréchet distance: when the graph $G$ is planar, we apply existing (approximate) distance oracles to compute a $(1+\varepsilon)$-approximation of the Fréchet distance between any shortest path $P$ and any walk $Q$ in $O(|G| \log |G| / \sqrt{\varepsilon} + |P| + \frac{|Q|}{\varepsilon } )$ time. We generalise this result to near-shortest paths, i.e. $κ$-straight paths, as we show how to compute a $(1+\varepsilon)$-approximation between a $κ$-straight path $P$ and any walk $Q$ in $O(|G| \log |G| / \sqrt{\varepsilon} + |P| + \frac{κ|Q|}{\varepsilon } )$ time. Our algorithmic results hold for both the strong and the weak discrete Fréchet distance over the shortest path metric in $G$. Finally, we show that additional assumptions on the input, such as our assumption on path straightness, are indeed necessary to obtain truly subquadratic running time. We provide a conditional lower bound showing that the Fréchet distance, or even its $1.01$-approximation, between arbitrary \emph{paths} in a weighted planar graph cannot be computed in $O((|P|\cdot|Q|)^{1-δ})$ time for any $δ> 0$ unless the Orthogonal Vector Hypothesis fails. For walks, this lower bound holds even when $G$ is planar, unit-weight and has $O(1)$ vertices.

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

↑