On rich lenses in planar arrangements of circles and related problems

arXiv2012.04204MaRDI QIDQ6355535FDOQ6355535

Authors: Esther Ezra, Orit E. Raz, Micha Sharir, J. Zahl 

Publication date: 7 December 2020

Abstract: We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $Oleft(frac{n}^{3/2}log(n/k^3)k^{5/2}+fracnkight)$, and the sum of the degrees of the lenses of such a family (where the degree of a lens is the number of circles that form it) is $Oleft(frac{n}^{3/2}log(n/k^3)k^{3/2}+night)$. Two independent proofs of these bounds are given, each interesting in its own right (so we believe). We then show that these bounds lead to the known bound of Agarwal et al. (JACM 2004) and Marcus and Tardos (JCTA 2006) on the number of point-circle incidences in the plane. Extensions to families of more general algebraic curves and some other related problems are also considered.

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Erd?s problems and related topics of discrete geometry (52C10) Combinatorial complexity of geometric structures (52C45) Extremal combinatorics (05D99)

This page was built for publication: On rich lenses in planar arrangements of circles and related problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355535)