Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.
Edelsbrunner, H. ; Welzl, E. ; Guibas, L.J. ; Clarkson, K.L. ; Sharir, M.
Discrete & computational geometry, Tome 5 (1990), p. 99-160 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1990-01-01
EUDML-ID : urn:eudml:doc:131110 
@article{GDZPPN000364320,
     title = {Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.},
     journal = {Discrete \& computational geometry},
     volume = {5},
     year = {1990},
     pages = {99-160},
     zbl = {0704.51003},
     url = {http://dml.mathdoc.fr/item/GDZPPN000364320}
}

Edelsbrunner, H.; Welzl, E.; Guibas, L.J.; Clarkson, K.L.; Sharir, M. Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.. Discrete & computational geometry, Tome 5 (1990) pp. 99-160. http://gdmltest.u-ga.fr/item/GDZPPN000364320/