On balanced 4-holes in bichromatic point sets

08/03/2017
by   S. Bereg, et al.
0

Let S=R∪ B be a point set in the plane in general position such that each of its elements is colored either red or blue, where R and B denote the points colored red and the points colored blue, respectively. A quadrilateral with vertices in S is called a 4-hole if its interior is empty of elements of S. We say that a 4-hole of S is balanced if it has 2 red and 2 blue points of S as vertices. In this paper, we prove that if R and B contain n points each then S has at least n^2-4n/12 balanced 4-holes, and this bound is tight up to a constant factor. Since there are two-colored point sets with no balanced convex 4-holes, we further provide a characterization of the two-colored point sets having this type of 4-holes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2020

A Note on Empty Balanced Tetrahedra in Two colored Point sets in ℝ^3

Let S be a set of n red and n blue points in general position in ℝ^3. Le...
research
09/01/2018

On Triangluar Separation of Bichromatic Point Sets in Polygonal Environment

Let P be a simple polygonal environment with k vertices in the plane. A...
research
07/21/2017

K_1,3-covering red and blue points in the plane

We say that a finite set of red and blue points in the plane in general ...
research
09/01/2023

Bichromatic Perfect Matchings with Crossings

We consider bichromatic point sets with n red and n blue points and stud...
research
08/21/2017

Balanced partitions of 3-colored geometric sets in the plane

Let S be a finite set of geometric objects partitioned into classes or c...
research
06/08/2023

Scenic Routes over Points in 2D Space

Consider a 2D coordinate space with a set of red and a set of blue point...
research
09/14/2022

Red Blue Set Cover Problem on Axis-Parallel Hyperplanes and Other Objects

Given a universe 𝒰=R ∪ B of a finite set of red elements R, and a finite...

Please sign up or login with your details

Forgot password? Click here to reset