On Range Searching with Semialgebraic Sets II

@article{Agarwal2012OnRS,
  title={On Range Searching with Semialgebraic Sets II},
  author={P. Agarwal and J. Matousek and M. Sharir},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
  year={2012},
  pages={420-429}
}
  • P. Agarwal, J. Matousek, M. Sharir
  • Published 2012
  • Mathematics, Computer Science
  • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
  • Let P be a set of n points in Rd. We present a linear-size data structure for answering range queries on P with constant-complexity semialgebraic sets as ranges, in time close to O(n1-1/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 long-standing open problem in range searching. The data structure is based on the polynomial… CONTINUE READING
    45 Citations
    On Range Searching with Semialgebraic Sets II
    • 4
    Multilevel Polynomial Partitions and Simplified Range Searching
    • 28
    • PDF
    Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications
    • 2
    • Highly Influenced
    • PDF
    Simplex Range Searching and Its Variants: A Review
    • 8
    • PDF
    On the Zarankiewicz problem for intersection hypergraphs
    • 6
    • PDF
    Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets
    • 1
    • PDF
    Dynamic Geometric Data Structures via Shallow Cuttings
    • T. Chan
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 2020
    • PDF
    On k Nearest Neighbor Queries in the Plane for General Distance Functions
    Almost tight bounds for eliminating depth cycles in three dimensions
    • 11
    • PDF

    References

    SHOWING 1-10 OF 52 REFERENCES
    On range searching with semialgebraic sets
    • 185
    • PDF
    On Range Searching with Semialgebraic Sets II
    • 4
    Efficient partition trees
    • 302
    Lower bounds on the complexity of polytope range searching
    • 120
    • PDF
    Semialgebraic Range Reporting and Emptiness Searching with Applications
    • 15
    • PDF
    Geometric Range Searching and Its Relatives
    • 360
    • PDF
    On Range Searching in the Group Model and Combinatorial Discrepancy
    • K. Larsen
    • Computer Science, Mathematics
    • 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
    • 2011
    • 22
    • PDF
    On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems
    • 15
    • PDF