## How to find largest triangle in convex hull aside from brute force search

Yes, you can do significantly better than brute-force. By brute-force I assume you mean checking all triples of points, and picking the one with maximum area. This runs in O(n3) time, but it turns out that it is possible to do it in not just O(n2) but in O(n) time! [Update: A paper published in … Read more