For a given set of $n$ points (in $ℝ^2$) find an enclosing polygon with minimum area. It seems that at first we need to triangulate the given set, and find an areas of all triangles. But I can't figure out what I have to do next. Maybe some kind of dynamic programming like $dp_{i,j}$ - an answer for first $i$ points where $j$th triangle is included to the polygon.
