arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.01696cs.CG
收藏

最优近似多面体隶属度

Optimal Approximate Polytope Membership

Sunil Arya, Guilherme D. da Fonseca, David M. Mount

摘要:

在多面体隶属度问题中,给出了$R^d$中的凸多面体$K$,并且目标是将$K$预处理成数据结构,使得给定查询点$q \in R^d$,可以有效地确定是否为$q \in K$。我们认为这个问题在一个近似的设置,并假设$d$是一个常数。给定近似参数$\varepsilon > 0$,如果从$q$到$K$的边界的距离至多是$K$的直径的$\varepsilon$倍,则可以以任一方式回答查询。以前的解决方案的问题是一个空间-时间权衡的形式,对数查询时间需要$O(1/\varepsilon^{d-1})$存储,而存储$O(1/\varepsilon^{(d-1)/2})$承认大致$O(1/\varepsilon^{(d-1)/8})$查询时间。在本文中,我们提出了一种数据结构,实现对数查询时间的存储只有$O(1/\varepsilon^{(d-1)/2})$,它匹配的最坏情况下的下限上的任何$\varepsilon$ -近似多面体的复杂性。我们的数据结构是基于一种新的技术,定义为近似Macbeath地区的椭球层次结构。作为一个应用,我们得到了主要的改进近似欧氏最近邻搜索。值得注意的是,在$O(\log \frac{n}{\varepsilon})$时间内回答一组$n$点的$\varepsilon$ -近似最近邻查询所需的存储被减少到$O(n/\varepsilon^{d/2})$。这使$\varepsilon$指数减半--现有空间边界的依赖性大约为$O(n/\varepsilon^d)$,它已经存在了15年(Har-Peled,2001)。

英文摘要:

In the polytope membership problem, a convex polytope $K$ in $R^d$ is given, and the objective is to preprocess $K$ into a data structure so that, given a query point $q \in R^d$, it is possible to determine efficiently whether $q \in K$. We consider this problem in an approximate setting and assume that $d$ is a constant. Given an approximation parameter $\varepsilon > 0$, the query can be answered either way if the distance from $q$ to $K$'s boundary is at most $\varepsilon$ times $K$'s diameter. Previous solutions to the problem were on the form of a space-time trade-off, where logarithmic query time demands $O(1/\varepsilon^{d-1})$ storage, whereas storage $O(1/\varepsilon^{(d-1)/2})$ admits roughly $O(1/\varepsilon^{(d-1)/8})$ query time. In this paper, we present a data structure that achieves logarithmic query time with storage of only $O(1/\varepsilon^{(d-1)/2})$, which matches the worst-case lower bound on the complexity of any $\varepsilon$-approximating polytope. Our data structure is based on a new technique, a hierarchy of ellipsoids defined as approximations to Macbeath regions. As an application, we obtain major improvements to approximate Euclidean nearest neighbor searching. Notably, the storage needed to answer $\varepsilon$-approximate nearest neighbor queries for a set of $n$ points in $O(\log \frac{n}{\varepsilon})$ time is reduced to $O(n/\varepsilon^{d/2})$. This halves the exponent in the $\varepsilon$-dependency of the existing space bound of roughly $O(n/\varepsilon^d)$, which has stood for 15 years (Har-Peled, 2001).

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

↑