"Combinatorial Complexity Bounds for Arrangement of Curves and Spheres."

Kenneth L. Clarkson et al. (1990)

> Home

Details and statistics

DOI: 10.1007/BF02187783

access: open

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcg/ClarksonEGSW90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/ClarksonEGSW90
Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. 5: 99-160 (1990)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.