Location of Repository

Tight lower bounds for halfspace range searching

By Sunil Arya, David M. Mount and Jian Xia

Abstract

We establish two new lower bounds for the halfspace range searching problem: Given a set of n points in R d, where each point is associated with a weight from a commutative semigroup, compute the semigroup sum of the weights of the points lying within any query halfspace. Letting m denote the space requirements, we prove a lower bound for general semigroups of ˜ Ω ( n 1−1/(d+1) /m 1/(d+1)) and for integral semigroups of ˜ Ω ( n/m 1/d). Our lower bounds are proved in the semigroup arithmetic model. Neglecting logarithmic factors, our result for integralsemigroupsmatchesthebestknownupperbounddueto Matouˇsek. Our result for general semigroups improves upon the best known lower bound due to Brönnimann, Chazelle, and Pach. Moreover, Fonseca and Mount have recently shown that, given uniformly distributed points, halfspace range queries over idempotent semigroups can be answered in O ( n 1−1/(d+1) /m 1/(d+1)) time in the semigrouparithmetic model. As our lower bounds are established for uniformly distributed point sets, it follows that they also resolve the computational complexity of halfspace range searching over idempotent semigroups in this important special case

Topics: problems and computations
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.308.5994
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.ust.hk/faculty/a... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.