Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
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
Improved bounds on the sample complexity of learning
Journal of Computer and System Sciences
The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
Spatially-decaying aggregation over a network: model and algorithms
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Space-time tradeoffs for approximate spherical range counting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
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
The effect of corners on the complexity of approximate range searching
Proceedings of the twenty-second annual symposium on Computational geometry
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximate Halfspace Range Counting
SIAM Journal on Computing
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
The paper consists of two major parts. In the first part, we re-examine relative ε-approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric problems, most notably to approximate range counting. We give a simple constructive proof of their existence in general range spaces with finite VC dimension, and of a sharp bound on their size, close to the best known one. We then give a construction of smaller-size relative ε-approximations for range spaces that involve points and halfspaces in two and higher dimensions. The planar construction is based on a new structure--spanning trees with small relative crossing number, which we believe to be of independent interest. In the second part, we consider the approximate halfspace range-counting problem in Rd with relative error ε, and show that relative ε-approximations, combined with the shallow partitioning data structures of Matoušek, yields efficient solutions to this problem. For example, one of our data structures requires linear storage and O(n1+δ) preprocessing time, for any δ0, and answers a query in time O(ε-γn1-1/⌊ d/2 ⌋ 2b log* n), for any γ 2/⌊ d/2⌋ the choice of γ and δ affects b and the implied constants. Several variants and extensions are also discussed.