Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.

H. Edelsbrunner; E. Welzl; L.J. Guibas; K.L. Clarkson; M. Sharir

Discrete & computational geometry (1990)

  • Volume: 5, Issue: 2, page 99-160
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Edelsbrunner, H., et al. "Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.." Discrete & computational geometry 5.2 (1990): 99-160. <http://eudml.org/doc/131110>.

@article{Edelsbrunner1990,
author = {Edelsbrunner, H., Welzl, E., Guibas, L.J., Clarkson, K.L., Sharir, M.},
journal = {Discrete & computational geometry},
keywords = {bounds; arrangements of curves; arrangements of spheres; many-face problems},
number = {2},
pages = {99-160},
title = {Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.},
url = {http://eudml.org/doc/131110},
volume = {5},
year = {1990},
}

TY - JOUR
AU - Edelsbrunner, H.
AU - Welzl, E.
AU - Guibas, L.J.
AU - Clarkson, K.L.
AU - Sharir, M.
TI - Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.
JO - Discrete & computational geometry
PY - 1990
VL - 5
IS - 2
SP - 99
EP - 160
KW - bounds; arrangements of curves; arrangements of spheres; many-face problems
UR - http://eudml.org/doc/131110
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.