convexHull()

The convexHull() function is a mathematical algorithm used to find the smallest convex polygon that completely encloses a set of points in a plane. The function takes a set of points as input and returns the set of points that form the vertices of the convex hull. The convex hull is useful in many applications, including computer graphics, computational geometry, and image processing. The algorithm has a time complexity of O(n log n), where n is the number of input points.