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

数据流的近似凸包

Approximate Convex Hull of Data Streams

Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, Lin F. Yang

摘要:

给定一个有限的点集$P \subseteq \mathbb{R}^d$,我们希望找到一个小的子集$S \subseteq P$,使得$S$的凸包近似包含$P$。更正式地说,$P$中的每个点都在$ε$到$S$的凸包的距离内。这样的子集$S$称为$ε$ -外壳。计算$ε$壳是计算几何、机器学习和近似算法中的一个重要问题.在许多实际应用程序中,$P$集合太大,内存中无法容纳。我们考虑的流模型中的算法顺序接收$P$点,并努力使用最小的内存量。用于计算$ε$外壳的现有流式算法需要$O(ε^{-(d-1)/2})$空间,这对于最坏情况输入是最优的。然而,这忽略了数据的结构。$P$的$ε$外壳的最小尺寸,我们用$\text{OPT}$表示,可以小得多。一个自然的问题是流算法是否可以仅使用$O(\text{OPT})$空间来计算$ε$外壳。我们从下限开始,表明不可能有一个单通道流算法,计算一个$ε$ -外壳与$O(\text{OPT})$空间。相反,我们提出了三个放松的问题,我们可以计算$ε$ -外壳使用空间近线性的最佳大小。我们的第一个算法的点在$\mathbb{R}^2$到达随机顺序使用$O(\log n\cdot \text{OPT})$空间。我们的第二个算法在输出$\mathbb{R}^2$-hull之前生成$O(\log(\frac{1}ε))$通道,并需要$O(\text{OPT})$空间。我们的第三个算法的点在$\mathbb{R}^d$为任何固定的尺寸$d$输出$ε$ -外壳,但$δ$ -分数的方向,并需要$O(\text{OPT} \cdot \log \text{OPT})$空间。

英文摘要:

Given a finite set of points $P \subseteq \mathbb{R}^d$, we would like to find a small subset $S \subseteq P$ such that the convex hull of $S$ approximately contains $P$. More formally, every point in $P$ is within distance $ε$ from the convex hull of $S$. Such a subset $S$ is called an $ε$-hull. Computing an $ε$-hull is an important problem in computational geometry, machine learning, and approximation algorithms. In many real world applications, the set $P$ is too large to fit in memory. We consider the streaming model where the algorithm receives the points of $P$ sequentially and strives to use a minimal amount of memory. Existing streaming algorithms for computing an $ε$-hull require $O(ε^{-(d-1)/2})$ space, which is optimal for a worst-case input. However, this ignores the structure of the data. The minimal size of an $ε$-hull of $P$, which we denote by $\text{OPT}$, can be much smaller. A natural question is whether a streaming algorithm can compute an $ε$-hull using only $O(\text{OPT})$ space. We begin with lower bounds that show that it is not possible to have a single-pass streaming algorithm that computes an $ε$-hull with $O(\text{OPT})$ space. We instead propose three relaxations of the problem for which we can compute $ε$-hulls using space near-linear to the optimal size. Our first algorithm for points in $\mathbb{R}^2$ that arrive in random-order uses $O(\log n\cdot \text{OPT})$ space. Our second algorithm for points in $\mathbb{R}^2$ makes $O(\log(\frac{1}ε))$ passes before outputting the $ε$-hull and requires $O(\text{OPT})$ space. Our third algorithm for points in $\mathbb{R}^d$ for any fixed dimension $d$ outputs an $ε$-hull for all but $δ$-fraction of directions and requires $O(\text{OPT} \cdot \log \text{OPT})$ space.

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

↑