离散 Fréchet 距离预言机
Discrete Fréchet Distance Oracles
AI总结:
针对一条曲线已知的离散 Fréchet 距离查询,本文构造近线性规模、次线性查询的预言机,并扩展至树路径及新提出的 $t$-局部图。
摘要:
两条长度为 $n$ 的曲线之间的离散 Fréchet 距离不太可能在严格次二次时间内计算。因此,我们考虑其中一条曲线 $P$ 预先已知的情形。具体而言,我们希望构造接近线性规模的数据结构(距离预言机),以支持在次线性时间内对 $P$ 进行高效距离查询。由于有证据表明,对于长度为 $Θ(n^α)$(任意 $α>0$)的查询曲线,这是不可能的,因此我们聚焦于长度为(较小)常数的查询曲线;对此,我们能够设计出具有理想界的距离预言机。\n我们将工具扩展到处理给定曲线的子曲线,乃至给定几何树中任意顶点到顶点的子曲线。也就是说,我们构造了一个预言机,能够快速计算短多边形路径(查询)与预处理树中由查询指定的两个顶点之间路径的距离。此外,我们定义了一类新的几何图,即 $t$-局部图(它严格包含具有常数拉伸率的几何伸展器族),并为其建立了类似的预言机:我们可以预处理该族中的图 $G$,从而在给定查询线段以及 $G$ 中一对顶点 $u,v$ 时,快速计算该线段与 $G$ 中任意 $(u,v)$-路径之间的最小离散 Fréchet 距离。当 $t=1$ 时答案是精确的,而当 $t>1$ 时答案是近似的。
英文摘要:
It is unlikely that the discrete Fréchet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to construct data structures (distance oracles) of near-linear size that support efficient distance queries with respect to $P$ in sublinear time. Since there is evidence that this is impossible for query curves of length $Θ(n^α)$, for any $α> 0$, we focus on query curves of (small) constant length, for which we are able to devise distance oracles with the desired bounds. We extend our tools to handle subcurves of the given curve, and even arbitrary vertex-to-vertex subcurves of a given geometric tree. That is, we construct an oracle that can quickly compute the distance between a short polygonal path (the query) and a path in the preprocessed tree between two query-specified vertices. Moreover, we define a new family of geometric graphs, $t$-local graphs (which strictly contains the family of geometric spanners with constant stretch), for which a similar oracle exists: we can preprocess a graph $G$ in the family, so that, given a query segment and a pair $u,v$ of vertices in $G$, one can quickly compute the smallest discrete Fréchet distance between the segment and any $(u,v)$-path in $G$. The answer is exact, if $t=1$, and approximate if $t>1$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。