Combinatorial complexity bounds for arrangements of curves and surfaces
Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, Emo Welzl · 1988
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.>