OPTIMAL SEPARABLE PARTITIONING IN THE PLANE

Sets of points are called separable if their convex hulls are disjoint . We suggest a technique for optimally partitioning of a set N into tw o separable subsets, N-1, N-2. We assume that a monotone measure, mu, is defined over the subsets of N, and the objective is to minimize max {mu(N-1),mu(N-2)}.