On some partitioning problems for two-colored point sets
Document typeConference report
Rights accessOpen Access
Let S be a two-colored set of n points in general position in the plane. We show that S admits at least 2 n 17 pairwise disjoint monochromatic triangles with vertices in S and empty of points of S. We further show that S can be partitioned into 3 n 11 subsets with pairwise disjoint convex hull such that within each subset all but at most one point have the same color. A lower bound on the number of subsets needed in any such partition is also given.
CitationGrima, C. [et al.]. On some partitioning problems for two-colored point sets. A: Encuentros de Geometría Computacional. "XIII Encuentros de Geometría Computacional". Zaragoza: 2009, p. 221-228.