Near equipartitions of colored point sets (Q2401334): Difference between revisions

The authors prove two theorems regarding partitions of coloured point sets. The first one deals with a set of \(nk\) 2-coloured points in general position in the plane (no three of the points are collinear), where \(n\) is minimal number of points of each colour. They prove that there exist \(n\) subsets with disjoint convex hulls (no two of them intersect) with the following properties (1) each pairwise disjoint convex subset contains \(k\) of the points, and (2) each pairwise disjoint convex subset contains points of both colours. The second theorem relates to partitions of coloured point sets in a space of higher dimensions. Specially, for a given set of \(n(d+1)\) \(d\)-coloured points in general position in a \(d\)-dimensional space there exist \(n\) pairwise disjoint convex subsets of \(d+1\) points, each of them containing points of all \(d\) colours.