Two elements are separated by a set S, if S contains exactly one of them. We prove that any set of n points in general position in the plane can be separated by O(nloglogn/logn) convex sets, and for some point sets @W(n/logn) convex sets are necessary.
['Dániel Gerbner', 'Géza Tóth']
Separating families of convex sets