How to remove minimum number of points of two sets such that their respective convex hulls are disjoint??

76 Views Asked by At

Suppose we are given two set of points A and B in a 2D plane, and their convex hulls are not disjoint, how to remove minimum number of points so that they become disjoint?

1

There are 1 best solutions below

8
On

Let $c(A)$ denote the convex hull of the set of points $A$, then remove the points $(c(A)\cap c(B))\cap A$ or $(c(A)\cap c(B))\cap B$, whichever has lesser points.