title: Polygon enclosing a set of points
body: <p>I have a set S of points (2D : defined by x and y) and I want to find P, the smallest (meaning : with the smallest number of points) polygon enclosing all the points of the set, P being an ordered subset of S.</p>
  
  <p>Are there any known algorithms to compute this? (my lack of culture in this domain is astonishing...)</p>
  
  <p>Thanks for your help</p>