Combinatorial complexity bounds for arrangements of curves and surfaces

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

  • Affiliations:
  • AT&TBell Lab., Murray Hill, NJ, USA;-;-;-;-

  • Venue:
  • SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

The authors study both the incidence counting and the many-faces problem for various kinds of curves, including lines, pseudolines, unit circles, general circles, and pseudocircles. They also extend the analysis to three dimensions, where they concentrate on the case of spheres, which is relevant for the three-dimensional unit-distance problem. They obtain upper bounds for certain quantities. The authors believe that the techniques they use are of independent interest.