找到最大可能三角形区域的最快方法

Let's imagine that we have a set of points in the plane, each described by pair of integer coordinates. Is there a way to find the triangle with vertices on this points with the greatest possible area faster than by O(n^3) algorithm?Let's imagine that we have a set of points in t