A New Parallel Algorithm for Finding Convex Hull Based on Maximum Pitch of the Dynamical Base Line Coiling with 4-Clusters,4-Domains and 4-Directions
基于四群四域四向动态基线倾角最大化圈绕的凸壳并行新算法

In this paper,the serial algorithm for finding convex hull based on maximum pitch of the base line coiling is improved to be the serial algorithm for finding convex hull based on maximum pitch of the dynamical base line coiling firstly; then,according to the isomorphic fundamental theorem of the convex hull construction and using the advantages of COW (Cluster of workstation),the serial algorithm for finding convex hull based on maximum pitch of the dynamical base line coiling is extended in multi-domains a...