Geodesic
Linear Space Data Structures for Two Types of Range Search.
Discrete & computational geometry, Tome 2 (1987), pp. 113-126.

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

Mots-clés : linear space data structures, range searching, homothetic range search problem, domination searching, computational geometry 
@article{DCG_1987__2_131014,
     author = {B. Chazelle and Herbert Edelsbrunner},
     title = {Linear {Space} {Data} {Structures} for {Two} {Types} of {Range} {Search.}},
     journal = {Discrete & computational geometry},
     pages = {113--126},
     publisher = {mathdoc},
     volume = {2},
     year = {1987},
     zbl = {0624.68054},
     url = {http://geodesic.mathdoc.fr/item/DCG_1987__2_131014/}
}
TY  - JOUR
AU  - B. Chazelle
AU  - Herbert Edelsbrunner
TI  - Linear Space Data Structures for Two Types of Range Search.
JO  - Discrete & computational geometry
PY  - 1987
SP  - 113
EP  - 126
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1987__2_131014/
ID  - DCG_1987__2_131014
ER  - 
%0 Journal Article
%A B. Chazelle
%A Herbert Edelsbrunner
%T Linear Space Data Structures for Two Types of Range Search.
%J Discrete & computational geometry
%D 1987
%P 113-126
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1987__2_131014/
%F DCG_1987__2_131014
B. Chazelle; Herbert Edelsbrunner. Linear Space Data Structures for Two Types of Range Search.. Discrete & computational geometry, Tome 2 (1987), pp. 113-126. http://geodesic.mathdoc.fr/item/DCG_1987__2_131014/