There's a conclusion which can be implemented to lower the time complexity of this problem.
Enumerate each point as the base point, then sort the other points in clockwise order around the base point, the triangle with the biggest circumcircle will always be formatted with the base point and two sequential points after the sorting process.
The time complexity is O (N2 log N).