How Hard is Halfspace Range Searching?. Brönnimann, H. & Chazelle, B. In Symposium on Computational Geometry, pages 271-275, 1992. ACM.
Link
Paper bibtex @inproceedings{ conf/compgeom/BronnimannC92,
added-at = {2015-01-30T00:00:00.000+0100},
author = {Brönnimann, Hervé and Chazelle, Bernard},
biburl = {http://www.bibsonomy.org/bibtex/2f40d22f75957c31c39456c2bf7925bc6/dblp},
booktitle = {Symposium on Computational Geometry},
crossref = {conf/compgeom/1992},
editor = {Avis, David},
ee = {http://doi.acm.org/10.1145/142675.142730},
interhash = {377fea4f7c31792153f8229005cee2de},
intrahash = {f40d22f75957c31c39456c2bf7925bc6},
isbn = {0-89791-517-8},
keywords = {dblp},
pages = {271-275},
publisher = {ACM},
title = {How Hard is Halfspace Range Searching?},
url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom92.html#BronnimannC92},
year = {1992}
}