Lower Bounds for Semialgebraic Range Searching and Stabbing Problems.

In the semialgebraic range searching problem, we are given a set of n points in ℝ^d, and we want to preprocess the points such that for any query range belonging to a family of constant complexity semialgebraic sets (Tarski cells), all the points intersecting the range can be reported or counted efficiently. When the ranges are composed of simplices, the problem is well-understood: It can be solved using S(n) space and with Q(n) query time with S(n)Q(n)^d=Õ(nd), where the Õ(⋅) notation hides polylogarithmic factors and this trade-off is tight (up to no(1) factors). In particular, there exist “low space” structures that use O(n) space with O(n^1-1/d) query time [8, 25] and “fast query” structures that use O(n^d) space with O(log n) query time [9]. However, for general semialgebraic ranges, only “low space” solutions are known, but the best solutions [7] match the same trade-off curve as simplex queries, with O(n) space and Õ(n^1−1/d) query time. It has been conjectured that the same could be done for the “fast query” case, but this open problem has stayed unresolved. Here, we disprove this conjecture. We give the first nontrivial lower bounds for semialgebraic range searching and other related problems. More precisely, we show that any data structure for reporting the points between two concentric circles, a problem that we call 2D annulus reporting, with Q(n) query time must use S(n)=...(n³/Q(n)⁵) space, where the ...(⋅) notation hides n^o(1) factors, meaning, for Q(n)=log^O(1)n, ...(n³) space must be used. In addition, we study the problem of reporting the subset of input points in a polynomial slab defined by {(x,y)∈R²:P(x)≤y≤P(x)+w}, where P(x)=∑_i=0^Δa_ixⁱ is a univariate polynomial of degree Δ and a0,…,aΔ,w are given at the query time, a problem that we call polynomial slab reporting. For this, we show a space lower bound of ...(n^Δ+1/Q(n)^(Δ+3)Δ/2), which implies that for Q(n)=log^O(1)n, we must use ...(n^Δ+1) space. We also consider the dual semialgebraic stabbing problems of semialgebraic range searching and present lower bounds for them. In particular, we show that in linear space, any data structure that solves 2D annulus stabbing problems must use ...(n^2/3) query time. Note that this almost matches the upper bound obtained by lifting 2D annuli to 3D. Like semialgebraic range searching, we also present lower bounds for general polynomial slab stabbing problems. Again, our lower bounds are almost tight for linear size data structures in this case. [ABSTRACT FROM AUTHOR]