We prove that every set of n red and n blue points in the plane contains a red and a blue point such that every circle through them encloses at least n(1-1{2}) -o(n) points of the set. This is a two-colored version of a problem posed by Neumann-Lara and Urrutia. We also show that every set S of n points contains two points such that either (i) every circle passing through them encloses at least%DIFDELCMD < \frac{n-2{3}}\rfloor %%% points of S, or (ii) every circle passing through them encloses at most%DIFDELCMD < \frac{2n-5{3}}%%% \frac{2n-3{3}} \rfloor points of S. The proofs make use of properties of higher order Voronoi diagrams, in the spirit of the work of Edelsbrunner, Hasan, Seidel and Shen on this topic. Closely related, we also study the number of collinear edges in higher order Voronoi diagrams and present several constructions.
We prove that every set of n red and n blue points in the plane contains a red and a blue point such that every circle through them encloses at least n(1-1{2}) -o(n) points of the set. This is a two-colored version of a problem posed by Neumann-Lara and Urrutia. We also show that every set S of n points contains two points such that every circle passing through them encloses at %DIFDELCMD < \frac{n-2{3}}\rfloor %%% %DIFDELCMD < \frac{2n-5{3}}%%% most\frac{2n-3{3}} \rfloor points of S. The proofs make use of properties of higher order Voronoi diagrams, in the spirit of the work of Edelsbrunner, Hasan, Seidel and Shen on this topic. Closely related, we also study the number of collinear edges in higher order Voronoi diagrams and present several constructions.
D
either (i)
D
least
D
points of S, or (ii) every circle passing through them encloses at most
A
most