Geodesic
e-Nets and Simplex Range Queries.
Discrete & computational geometry, Tome 2 (1987), pp. 127-152.

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

Mots-clés : simplex range queries, counting problem, partitioning point sets, data structure, query half space, sublinear time, partition tree structure 
@article{DCG_1987__2_131015,
     author = {D. Haussler and Emo Welzl},
     title = {e-Nets and {Simplex} {Range} {Queries.}},
     journal = {Discrete & computational geometry},
     pages = {127--152},
     publisher = {mathdoc},
     volume = {2},
     year = {1987},
     zbl = {0619.68056},
     url = {http://geodesic.mathdoc.fr/item/DCG_1987__2_131015/}
}
TY  - JOUR
AU  - D. Haussler
AU  - Emo Welzl
TI  - e-Nets and Simplex Range Queries.
JO  - Discrete & computational geometry
PY  - 1987
SP  - 127
EP  - 152
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1987__2_131015/
ID  - DCG_1987__2_131015
ER  - 
%0 Journal Article
%A D. Haussler
%A Emo Welzl
%T e-Nets and Simplex Range Queries.
%J Discrete & computational geometry
%D 1987
%P 127-152
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1987__2_131015/
%F DCG_1987__2_131015
D. Haussler; Emo Welzl. e-Nets and Simplex Range Queries.. Discrete & computational geometry, Tome 2 (1987), pp. 127-152. http://geodesic.mathdoc.fr/item/DCG_1987__2_131015/