On rich lenses in planar arrangements of circles and related problems

12/08/2020
by   Esther Ezra, et al.
0

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 O(n^3/2log(n/k^3)/k^5/2 + n/k), 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 O(n^3/2log(n/k^3)/k^3/2 + n). 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2020

Incidences with curves in three dimensions

We study incidence problems involving points and curves in R^3. The curr...
research
12/22/2020

On rich points and incidences with restricted sets of lines in 3-space

Let L be a set of n lines in R^3 that is contained, when represented as ...
research
03/04/2020

Incidences between points and curves with almost two degrees of freedom

We study incidences between points and algebraic curves in three dimensi...
research
11/17/2019

A Crossing Lemma for Families of Jordan Curves with a Bounded Intersection Number

A family of closed simple (i.e., Jordan) curves is m-intersecting if any...
research
09/09/2017

Homotheties and incidences

We consider problems involving rich homotheties in a set S of n points i...
research
12/09/2019

Algebraic k-sets and generally neighborly embeddings

Given a set S of n points in R^d, a k-set is a subset of k points of S t...
research
07/21/2020

A family of non-periodic tilings of the plane by right golden triangles

We consider tilings of the plane by two prototiles which are right trian...

Please sign up or login with your details

Forgot password? Click here to reset