On the Complexity of Many Faces in Arrangements of Circles

Authors:
P. Agarwal;B. Aronov;M. Sharir
Affiliations:
-;-;-
Venue:
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Year:
2001

Citing 0
Cited 3

Lenses in arrangements of pseudo-circles and their applications

Proceedings of the eighteenth annual symposium on Computational geometry
Pseudo-line arrangements: duality, algorithms, and applications

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Intersection reverse sequences and geometric applications

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We obtain improved bounds on the complexity of m distinct faces in an arrangement of n circles and in an arrangement of n unit circles. The bounds are worst-case tight for unit circles, and, for general circles, they nearly coincide with the best known bounds for the number of incidences between m points and n circles.