Geodesic
Cutting Hyperplanes for Divide-and-Conquer.
Discrete & computational geometry, Tome 9 (1993) no. 2, pp. 145-158

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

Mots-clés : computational geometry, hyperplane arrangement, cutting, simplex, divide- and-conquer, segment intersection, line/point incidence, linear programming, point location, epsilon-net, deterministic algorithm 
@article{DCG_1993__9_2_131240,
     author = {B. Chazelle},
     title = {Cutting {Hyperplanes} for {Divide-and-Conquer.}},
     journal = {Discrete & computational geometry},
     pages = {145--158},
     publisher = {mathdoc},
     volume = {9},
     number = {2},
     year = {1993},
     zbl = {0784.52018},
     url = {http://geodesic.mathdoc.fr/item/DCG_1993__9_2_131240/}
}
TY  - JOUR
AU  - B. Chazelle
TI  - Cutting Hyperplanes for Divide-and-Conquer.
JO  - Discrete & computational geometry
PY  - 1993
SP  - 145
EP  - 158
VL  - 9
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1993__9_2_131240/
ID  - DCG_1993__9_2_131240
ER  - 
%0 Journal Article
%A B. Chazelle
%T Cutting Hyperplanes for Divide-and-Conquer.
%J Discrete & computational geometry
%D 1993
%P 145-158
%V 9
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1993__9_2_131240/
%F DCG_1993__9_2_131240
B. Chazelle. Cutting Hyperplanes for Divide-and-Conquer.. Discrete & computational geometry, Tome 9 (1993) no. 2, pp. 145-158. http://geodesic.mathdoc.fr/item/DCG_1993__9_2_131240/