Geodesic
Range Searching with Efficient Hierarchical Cuttings.
Discrete & computational geometry, Tome 10 (1993) no. 2, pp. 157-182.

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

Mots-clés : simplex range searching problem, linear-space, data structures 
@article{DCG_1993__10_2_131268,
     author = {J. Matousek},
     title = {Range {Searching} with {Efficient} {Hierarchical} {Cuttings.}},
     journal = {Discrete & computational geometry},
     pages = {157--182},
     publisher = {mathdoc},
     volume = {10},
     number = {2},
     year = {1993},
     zbl = {0774.68101},
     url = {http://geodesic.mathdoc.fr/item/DCG_1993__10_2_131268/}
}
TY  - JOUR
AU  - J. Matousek
TI  - Range Searching with Efficient Hierarchical Cuttings.
JO  - Discrete & computational geometry
PY  - 1993
SP  - 157
EP  - 182
VL  - 10
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1993__10_2_131268/
ID  - DCG_1993__10_2_131268
ER  - 
%0 Journal Article
%A J. Matousek
%T Range Searching with Efficient Hierarchical Cuttings.
%J Discrete & computational geometry
%D 1993
%P 157-182
%V 10
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1993__10_2_131268/
%F DCG_1993__10_2_131268
J. Matousek. Range Searching with Efficient Hierarchical Cuttings.. Discrete & computational geometry, Tome 10 (1993) no. 2, pp. 157-182. http://geodesic.mathdoc.fr/item/DCG_1993__10_2_131268/