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

局部敏感序及其应用

On Locality-Sensitive Orderings and their Applications

Timothy M. Chan, Sariel Har-Peled, Mitchell Jones

摘要:

对于任何常数$d$和参数$\varepsilon > 0$,我们证明了单位立方体$[0,1)^d$上存在(粗略地)$1/\varepsilon^d$排序,使得在欧几里德度量下靠近在一起的任何两个点$p,q\in [0,1)^d$在这些线性排序中的一个中是“靠近在一起”的,在以下意义下:在排序中可能位于$p$和$q$之间的仅有的点是与$p$或$q$具有最多$\varepsilon\| p - q \|$的欧几里德距离的点。这些排序是$\mathcal{Z}$ -序的扩展,并且它们可以被有效地计算。在功能上,排序可以被认为是四叉树和相关结构(如良好分离的对分解)的替代品。我们使用这样的排序,以获得令人惊讶的简单算法的一些基本问题,在低维计算几何,包括(i)动态近似双色最近对,(ii)动态spectrometry,(iii)动态近似最小生成树,(iv)静态和动态容错spectrometry,和(v)近似最近邻搜索。

英文摘要:

For any constant $d$ and parameter $\varepsilon > 0$, we show the existence of (roughly) $1/\varepsilon^d$ orderings on the unit cube $[0,1)^d$, such that any two points $p,q\in [0,1)^d$ that are close together under the Euclidean metric are "close together" in one of these linear orderings in the following sense: the only points that could lie between $p$ and $q$ in the ordering are points with Euclidean distance at most $\varepsilon\| p - q \|$ from $p$ or $q$. These orderings are extensions of the $\mathcal{Z}$-order, and they can be efficiently computed. Functionally, the orderings can be thought of as a replacement to quadtrees and related structures (like well-separated pair decompositions). We use such orderings to obtain surprisingly simple algorithms for a number of basic problems in low-dimensional computational geometry, including (i) dynamic approximate bichromatic closest pair, (ii) dynamic spanners, (iii) dynamic approximate minimum spanning trees, (iv) static and dynamic fault-tolerant spanners, and (v) approximate nearest neighbor search.

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

↑