How Hard Is Half-Space Range Searching?
Pach, J. ; Chazelle, B. ; Brönnimann, H.
Discrete & computational geometry, Tome 10 (1993), p. 143-156 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1993-01-01
EUDML-ID : urn:eudml:doc:131267 
@article{GDZPPN000366080,
     title = {How Hard Is Half-Space Range Searching?},
     journal = {Discrete \& computational geometry},
     volume = {10},
     year = {1993},
     pages = {143-156},
     zbl = {0778.68087},
     url = {http://dml.mathdoc.fr/item/GDZPPN000366080}
}

Pach, J.; Chazelle, B.; Brönnimann, H. How Hard Is Half-Space Range Searching?. Discrete & computational geometry, Tome 10 (1993) pp. 143-156. http://gdmltest.u-ga.fr/item/GDZPPN000366080/