Description: The convex hull (ConvexHull) is the smallest convex polygon that surrounds the point to its interior. The time complexity is O (n). First, the convex hull is computed, and the input point group P is given. The number of points is n, and the output point array is ch. Returns the convex hull number of the function.
To Search:
File list (Check if you may need any files):
求凸包安德鲁算法.cpp
Download