Geodesic
The Complexity of Many Cells in Arrangements of Planes and Related Problems.
Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 197-216 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : computational geometry, arrangements of planes, random sampling, -nets 
@article{DCG_1990__5_2_131112,
     author = {H. Edelsbrunner and L.J. Guibas and M. Sharir},
     title = {The {Complexity} of {Many} {Cells} in {Arrangements} of {Planes} and {Related} {Problems.}},
     journal = {Discrete & computational geometry},
     pages = {197--216},
     year = {1990},
     volume = {5},
     number = {2},
     zbl = {0691.68036},
     url = {http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131112/}
}
TY  - JOUR
AU  - H. Edelsbrunner
AU  - L.J. Guibas
AU  - M. Sharir
TI  - The Complexity of Many Cells in Arrangements of Planes and Related Problems.
JO  - Discrete & computational geometry
PY  - 1990
SP  - 197
EP  - 216
VL  - 5
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131112/
ID  - DCG_1990__5_2_131112
ER  - 
%0 Journal Article
%A H. Edelsbrunner
%A L.J. Guibas
%A M. Sharir
%T The Complexity of Many Cells in Arrangements of Planes and Related Problems.
%J Discrete & computational geometry
%D 1990
%P 197-216
%V 5
%N 2
%U http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131112/
%F DCG_1990__5_2_131112
H. Edelsbrunner; L.J. Guibas; M. Sharir. The Complexity of Many Cells in Arrangements of Planes and Related Problems.. Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 197-216. http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131112/