Geodesic
Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.
Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 99-160 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : bounds, arrangements of curves, arrangements of spheres, many-face problems 
@article{DCG_1990__5_2_131110,
     author = {H. Edelsbrunner and E. Welzl and L.J. Guibas and K.L. Clarkson and M. Sharir},
     title = {Combinatorial {Complexity} {Bounds} for {Arrangements} of {Curves} and {Spheres.}},
     journal = {Discrete & computational geometry},
     pages = {99--160},
     year = {1990},
     volume = {5},
     number = {2},
     zbl = {0704.51003},
     url = {http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131110/}
}
TY  - JOUR
AU  - H. Edelsbrunner
AU  - E. Welzl
AU  - L.J. Guibas
AU  - K.L. Clarkson
AU  - M. Sharir
TI  - Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.
JO  - Discrete & computational geometry
PY  - 1990
SP  - 99
EP  - 160
VL  - 5
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131110/
ID  - DCG_1990__5_2_131110
ER  - 
%0 Journal Article
%A H. Edelsbrunner
%A E. Welzl
%A L.J. Guibas
%A K.L. Clarkson
%A M. Sharir
%T Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.
%J Discrete & computational geometry
%D 1990
%P 99-160
%V 5
%N 2
%U http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131110/
%F DCG_1990__5_2_131110
H. Edelsbrunner; E. Welzl; L.J. Guibas; K.L. Clarkson; M. Sharir. Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.. Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 99-160. http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131110/