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

高维近似$r$ -网

High-dimensional approximate $r$-nets

Georgia Avarikioti, Ioannis Z. Emiris, Loukas Kavouras, Ioannis Psarros

摘要:

$r$ -网的构造为计算几何和度量几何提供了强有力的工具。我们专注于高维空间,并提出了一个新的随机算法,有效地计算近似$r$ -网相对于欧几里德距离。对于任何固定的$ε>0$,近似因子是$1+ε$,复杂度在维数上是多项式的,在点数上是次二次的。该算法成功的概率很高。更具体地说,先前已知的最好的基于LSH的构建是Eppstein et al.如果$ε$足够小,则通过减少对$ε$的依赖性来改善\cite{EHS15}的复杂性。我们的方法不需要LSH,而是遵循Valiant的\cite{Val15}方法,在不同的空间中,根据欧氏距离或内积,其中$r$ -网的计算效率和误差可以控制的减少我们的问题的序列。我们的结果立即意味着有效的解决方案,一些几何问题,在高维,如寻找$(1+ε)$ -近似$k$次最近邻距离在时间次二次输入的大小。

英文摘要:

The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean distance. For any fixed $ε>0$, the approximation factor is $1+ε$ and the complexity is polynomial in the dimension and subquadratic in the number of points. The algorithm succeeds with high probability. More specifically, the best previously known LSH-based construction of Eppstein et al.\ \cite{EHS15} is improved in terms of complexity by reducing the dependence on $ε$, provided that $ε$ is sufficiently small. Our method does not require LSH but, instead, follows Valiant's \cite{Val15} approach in designing a sequence of reductions of our problem to other problems in different spaces, under Euclidean distance or inner product, for which $r$-nets are computed efficiently and the error can be controlled. Our result immediately implies efficient solutions to a number of geometric problems in high dimension, such as finding the $(1+ε)$-approximate $k$th nearest neighbor distance in time subquadratic in the size of the input.

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

↑