Math @ Duke

Publications [#235381] of Pankaj K. Agarwal
Papers Published
 Agarwal, PK; Matoušek, J; Sharir, M, On range searching with semialgebraic sets II,
Annual Symposium on Foundations of Computer Science
(2012),
pp. 420429, ISSN 02725428 [doi]
(last updated on 2018/05/23)
Abstract: Let P be a set of n points in ℝd. We present a linearsize data structure for answering range queries on P with constantcomplexity semi algebraic sets as ranges, in time close to O(n11/d). It essentially matches the performance of similar structures for simplex range searching, and, for d ≥ 5, significantly improves earlier solutions by the first two authors obtained in~1994. This almost settles a longstanding open problem in range searching. The data structure is based on the polynomialpartitioning technique of Guth and Katz [arXiv:1011.4105], which shows that for a parameter r, 1 < r ≤ n, there exists a dvariate polynomial f of degree O(r1/d) such that each connected component of ℝd \ Z(f) contains at most n/r points of P, where Z(f) is the zero set of f. We present an ef?cient randomized algorithm for computing such a polynomial partition, which is of independent interest and is likely to have additional applications. © 2012 IEEE.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

