We are given a set S of colored points and a positive integer κ. A subset of S is monochromatic if it contains points of only one color. We prove that it is NP-complete to decide whether S can be partitioned into at most κ monochromatic subsets whose convex hulls are pairwise-disjoint.
Broek et al. (Wed,) studied this question.