Reporting points in halfspaces
Computational Geometry: Theory and Applications
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Size-estimation framework with applications to transitive closure and reachability
Journal of Computer and System Sciences
Product Range Spaces, Sensitive Sampling, and Derandomization
SIAM Journal on Computing
Improved bounds on the sample complexity of learning
Journal of Computer and System Sciences
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Space-time tradeoffs for approximate spherical range counting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On approximate halfspace range counting and relative epsilon-approximations
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Approximate range searching in higher dimension
Computational Geometry: Theory and Applications
On Approximating the Depth and Related Problems
SIAM Journal on Computing
Tradeoffs in Approximate Range Searching Made Simpler
SIBGRAPI '08 Proceedings of the 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing
The Effect of Corners on the Complexity of Approximate Range Searching
Discrete & Computational Geometry
On Approximate Range Counting and Depth
Discrete & Computational Geometry - 23rd Annual Symposium on Computational Geometry
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting
Discrete & Computational Geometry
Relative (p,ε)-Approximations in Geometry
Discrete & Computational Geometry
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
approximate range searching: the absolute model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
Hi-index | 0.00 |
We present a simple scheme extending the shallow partitioning data structures of Matoušek, which supports efficient approximate halfspace range-counting queries in $\mathbb{R}^d$ with relative error $\varepsilon$. Specifically, the problem is, given a set $P$ of $n$ points in $\mathbb{R}^d$, to preprocess them into a data structure that returns, for a query halfspace $h$, a number $t$ so that $(1-\varepsilon)|h\cap P|\leq t\leq(1+\varepsilon)|h\cap P|$. One of our data structures requires linear storage and $O(n^{1+\delta})$ preprocessing time, for any $\delta0$, and answers a query in time $O(\varepsilon^{-\gamma}n^{1-1/\lfloor d/2\rfloor}2^{b\log^\ast n})$ for any $\gamma2/\lfloor d/2\rfloor$; the choice of $\gamma$ and $\delta$ affects $b$ and the implied constants. Several variants and extensions are also discussed. As presented, the construction of the structure is mostly deterministic, except for one critical randomized step, and so are the query, storage, and preprocessing costs. The quality of approximation, for every query, is guaranteed with high probability. The construction can also be fully derandomized, at the expense of increasing preprocessing time.