Area Of Triangle

[silentsiren1987]

Hello ,

I am trying to find the triangle with maximum area , from a given set of 'n' integer co-ordinates of the form x,y .
Only problem is 'n' is huge ( of the order of 10^6) so i have to use an efficient method.

So i constructed a convex hull from the given n points. Now i have the vertices of the convex polygon and i need to calculate the area of the maximum triangle.

Is it correct that if i choose any two vertices of the convex hull and then loop over the remaining vertices one by one , every time calculating the area and marking the one with the maximum area , i will get the right answer?
If not please correct me .

thanks