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

实用的低维半空间距离空间采样

Practical Low-Dimensional Halfspace Range Space Sampling

Michael Matheny, Jeff M. Phillips

摘要:

我们开发,分析,实施和比较新的算法,用于创建$\varepsilon$-样本的范围空间定义的半空间,其大小次二次在$1/\varepsilon$,并具有运行时线性的输入大小和近二次在$1/\varepsilon$。我们的解决方案的关键是一个有效的构造分区树。尽管不需要20世纪90年代初之后开发的任何技术,但显然这样的结果从未被明确描述过。我们证明,我们的实现,包括新的实现的几个变种的分区树,确实运行在时间线性的输入,似乎运行线性的输出大小,并观察到较小的误差为相同大小的样本相比,无处不在的随机样本(这需要大小二次$1/\varepsilon$)。这一结果在加速差异评估、近似范围计数和空间异常检测方面具有直接的应用。

英文摘要:

We develop, analyze, implement, and compare new algorithms for creating $\varepsilon$-samples of range spaces defined by halfspaces which have size sub-quadratic in $1/\varepsilon$, and have runtime linear in the input size and near-quadratic in $1/\varepsilon$. The key to our solution is an efficient construction of partition trees. Despite not requiring any techniques developed after the early 1990s, apparently such a result was not ever explicitly described. We demonstrate that our implementations, including new implementations of several variants of partition trees, do indeed run in time linear in the input, appear to run linear in output size, and observe smaller error for the same size sample compared to the ubiquitous random sample (which requires size quadratic in $1/\varepsilon$). This result has direct applications in speeding up discrepancy evaluation, approximate range counting, and spatial anomaly detection.

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

↑