Abstract: Based on one of the characteristics of convex polygons, i.e. when the edges of a convex polygon are traversed along one direction, the interior of the convex polygon is always on the same side of these edges, a new algorithm for computing the convex hull

Key words: Computational geometry,Convex hull, Extreme points, Sorted convex hull point array, Space-efficlent