Triangle Search Approach for Convex Hull

Here we loop over all possible triangles in the point space and for each triangle we determine if the other points are within or not within the triangle. If they are inside the triangle then they cannot be in the convex hull. We start by assuming that all points are part of the convex hull and during iteration we remove the points which are found to be within a triangle. What we are left with is points that are part of the convex hull