"Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces"

Kenneth L. Clarkson et al. (1988)

> Home

Details and statistics

DOI: 10.1109/SFCS.1988.21973

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/ClarksonEGSW88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ClarksonEGSW88
Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. FOCS 1988: 568-579

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.