Discrete & Computational Geometry

, Volume 10, Issue 2, pp 143–155

How hard is half-space range searching?

Authors

  • Hervé Brönnimann
    • Department of Computer SciencePrinceton University
  • Bernard Chazelle
    • Department of Computer SciencePrinceton University
  • János Pach
    • Department of Computer Science, City CollegeC.U.N.Y.
    • Courant InstituteN.Y.U.
Article

DOI: 10.1007/BF02573971

Cite this article as:
Brönnimann, H., Chazelle, B. & Pach, J. Discrete Comput Geom (1993) 10: 143. doi:10.1007/BF02573971

Abstract

We investigate the complexity ofhalf-space range searching: givenn points ind-space, build a data structure that allows us to determine efficiently how many points lie in a query half-space. We establish a tradeoff between the storagem and the worst-case query timet in the Fredman/Yao arithmetic model of computation. We show thatt must be at least on the order of
$$\frac{{(n/\log n)^{1 - (d - 1)/d(d + 1)} }}{{m^{1/d} }}$$

Although the bound is unlikely to be optimal, it falls reasonably close to the recent upper bound ofO(n/m1/d) established by Matoušek. We also show that it is possible to devise a sequence ofn inserts and half-space range queries that require a total time ofn2-O(1/d). Our results imply the first nontrivial lower bounds for spherical range searching in any fixed dimension. For example, they show that, with linear storage, circular range queries in the plane require Ω(n1/3) time (modulo a logarithmic factor).

Copyright information

© Springer-Verlag New York Inc. 1993