The algorithm to construct the convex hull for a set of finite points in two-dimensional Euclidean space has been applied in many applications. In this paper, a modified quadrilateral algorithm is proposed to construct the convex hull. This method is based on a divide-and- conquer strategy and divides the input finite points into two parts. All the quadrilaterals can be found in each part by just comparing the x-coordinate of every point and the internal points are eliminated. When all of the points have been processed, the vertices of the convex hull belong to all the vertices of the quadrilaterals. Some distributed data samples are examined to demonstrate the efficiency of this algorithm. The average and worst cases are also discussed.
關聯:
1994 International Computer Symposium Conference Proceeding Volume 2 of 2，頁744-749
