Approximate Halfspace Range Counting
From MaRDI portal
Publication:5390575
DOI10.1137/080736600zbMath1216.68079MaRDI QIDQ5390575
Publication date: 4 April 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cf26e00185747bbfef99bcdfc592a824e25702a0
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68P10: Searching and sorting
68P05: Data structures
68W25: Approximation algorithms
68W20: Randomized algorithms
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Simplex Range Searching and Its Variants: A Review, A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension, Range minima queries with respect to a random permutation, and approximate range counting, Relative \((p,\varepsilon )\)-approximations in geometry, The overlay of minimization diagrams in a randomized incremental construction