Geodesic
How Hard Is Half-Space Range Searching?
Discrete & computational geometry, Tome 10 (1993) no. 2, pp. 143-156

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : range searching, lower bounds 
@article{DCG_1993__10_2_131267,
     author = {J. Pach and B. Chazelle and H. Br\"onnimann},
     title = {How {Hard} {Is} {Half-Space} {Range} {Searching?}},
     journal = {Discrete & computational geometry},
     pages = {143--156},
     publisher = {mathdoc},
     volume = {10},
     number = {2},
     year = {1993},
     zbl = {0778.68087},
     url = {http://geodesic.mathdoc.fr/item/DCG_1993__10_2_131267/}
}
TY  - JOUR
AU  - J. Pach
AU  - B. Chazelle
AU  - H. Brönnimann
TI  - How Hard Is Half-Space Range Searching?
JO  - Discrete & computational geometry
PY  - 1993
SP  - 143
EP  - 156
VL  - 10
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1993__10_2_131267/
ID  - DCG_1993__10_2_131267
ER  - 
%0 Journal Article
%A J. Pach
%A B. Chazelle
%A H. Brönnimann
%T How Hard Is Half-Space Range Searching?
%J Discrete & computational geometry
%D 1993
%P 143-156
%V 10
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1993__10_2_131267/
%F DCG_1993__10_2_131267
J. Pach; B. Chazelle; H. Brönnimann. How Hard Is Half-Space Range Searching?. Discrete & computational geometry, Tome 10 (1993) no. 2, pp. 143-156. http://geodesic.mathdoc.fr/item/DCG_1993__10_2_131267/