Given $n$ points on a plane. Some of them are white, and some are black. No two points coincide. No three points lie on the same line.

You are required to move one of the white points a distance of $\leq r$ in such a way as to maximize the area of the convex hull of the set of points that you will have after this operation.