@conference {15620,
	title = {Tight lower bounds for halfspace range searching},
	booktitle = {Proceedings of the 2010 annual symposium on Computational geometry},
	series = {SoCG {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {29 - 37},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We establish two new lower bounds for the halfspace range searching problem: Given a set of n points in ℜ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 Ω(n1-1/(d+1)/m1/(d+1)) and for integral semigroups of Ω(n/m1/d). Our lower bounds are proved in the semigroup arithmetic model. Neglecting logarithmic factors, our result for integral semigroups matches the best known upper bound due to Matou{\v s}ek. Our result for general semigroups improves upon the best known lower bound due to Br{\"o}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(n1-1/(d+1)/m1/(d+1)) time in the semigroup arithmetic 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.},
	keywords = {Idempotence, lower bounds, Range searching},
	isbn = {978-1-4503-0016-2},
	doi = {10.1145/1810959.1810964},
	url = {http://doi.acm.org/10.1145/1810959.1810964},
	author = {Arya,Sunil and Mount, Dave and Xia,Jian}
}
