searching such non convex hull over a finite set of points is a np complete problem with combinatorial complexity on the opposite finding the convex hull has a much lower complexity in o n where n is the number of points in the set