Papers
Topics
Authors
Recent
Search
2000 character limit reached

On balanced 4-holes in bichromatic point sets

Published 3 Aug 2017 in cs.CG | (1708.01321v1)

Abstract: Let S=R∪BS=R\cup B be a point set in the plane in general position such that each of its elements is colored either red or blue, where RR and BB denote the points colored red and the points colored blue, respectively. A quadrilateral with vertices in SS is called a $4$-hole if its interior is empty of elements of SS. We say that a $4$-hole of SS is balanced if it has $2$ red and $2$ blue points of SS as vertices. In this paper, we prove that if RR and BB contain nn points each then SS has at least n<sup>2−4n12\frac{n<sup>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 {\em convex} $4$-holes, we further provide a characterization of the two-colored point sets having this type of $4$-holes.

Citations (10)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.