Find biggest possible polygon of group of points

How to find the biggest possible polygon of a group of points?

E.g. the following points are given:

0 | 3
4 | 0
1 | 1
0 | 0

-> Use the 1st, 2nd and 4th point to build a polygon (3r开发者_开发问答d point is useless)

What you seems to be looking for is the Convex Hull.

Example:

The Gift Wrapping Algorithm is the easiest way to calculate the Convex Hull, but it isn't optimal.

Chan's algorithm is probably the simplest optimal algorithm.

HTH!