Practical Low-Dimensional Halfspace Range Space Sampling
Published in European Symposium on Algorithms Track b, 2018
Recommended citation: Michael Matheny and Jeff M. Phillips. Practical low-dimensional halfspace range space sampling. In European Symposium on Algorithms (arXiv:1804.11307), 2018. https://arxiv.org/abs/1804.11307
We develop, analyze, implement, and compare new algorithms for creating $\varepsilon$-samples of range spaces defined by halfspaces which have size sub-quadratic in $\frac{1}{\varepsilon}$, and have runtime linear in the input size and near-quadratic in $\frac{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 $\frac{1}{\varepsilon}$). This result has direct applications in speeding up discrepancy evaluation, approximate range counting, and spatial anomaly detection.