title: Algorithm to find min area covered X percents of geopoints
body: <p>There is a convex geo polygon consisting of 200 vertexes (lat, lng). Lets call it M.
  There is a set of geo points inside it (about 15 000 points). P = {1 ... 15 000}.
  Also there is another convex geo polygon inside the first one (M) and consisting of 50 vertexes. Lets call it S.
  Polygon S contains 43 percent of points of P.
  I need some algorithm to increase the area of S (by moving the points of original polygon S) to get minimum area that will contain 55 percent of points of P. Is it possible?</p>