Parallel convex hull algorithm of planar point set based on PC cluster
平面点集凸包的并行算法研究

The convex hull problem is one of the fundamental problem in computational geometry,and wildly used in many fields.In this paper,A new parallel algorithm was proposed by combining improved fast convex hull algorithm of planar point set based on sorted simple polygon in this paper.The worst-case time complexity of the algorithm was O(n).The algorithm used in COW parallel computing system and MPI parallel environment.Compared with the original serial algorithm,this method was viable,accurate and highly efficient.