Polygon enclosing a set of points

Question

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

Answer 1

Here's a good resource on convex hull algorithms: The Convex Hull of a 2D Point Set or Polygon (by Dan Sunday)