find the smallest containing convex polygon with a given number of points

Question

given a convex polgyon and a number N, how do I find the smallest polygon that

1. contains every point from the original polygon
2. has exactly N corner poi

Answer 1

While number of edges > N do
  remove the shortest edge by replacing its endpoints 
  with the intersection point of the adjacent edges