And how do you guys find the points on the convex hull.
For the whole task I am thinking for algo like this : select 3 random points from the set and make "Starting triangle". For every one of the remining points do the following : If the point is inside the "Starting triangle" remove it from the set. If it's outside the "Starting triangle" find the biggest triangle among the 4 points and make new "Starting triangle", the remaining point leave in the set. O(n) Repeat the same algo second time with "Starting triangle" the biggest triangle from the first iteration. This is ones again O(n). For the remaining points in the set brood force with O(m^3). this gives 2*O(n)*O(m^3) which is actualy O(n)*O(m^3) but here comes the biggest problem. If all the points are on a hull (circle for example) the algorithem goes to O(n)*O(n^3) which is O(n^4)
