A new parallel algorithm for finding convex hull based on COW with 2-clusters, 2-domains and 2-directions

This paper comment on the lower efficiency shortcomings of representative both series algorithms for finding convex hull (for example: Gift wrapping convex hull algorithm, Graham scan convex hull algorithm, and Algorithm for finding convex hull based on coiling with a minimum lever pitch) and parallel algorithms for finding convex hull(for example: Half-dividing convex hull algorithm, Rapid convex hull algorithm ,Grid convex hull algorithm),and based on the isomorphic fundamental theorem of the convex hull construction, a more efficient new parallel algorithm to find a convex hull based on COW is given. The general characters of the new algorithm are: 1) its COW is combined with two sub-clusters; 2) its domain sub is divided into two sub-domains; 3) its seeking direction is along with two ways (i. e. clockwise direction, and anti clockwise direction).