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.