A Convex Hull Algorithm Based on Convex Polygon
基于凸多边形的凸壳算法

Convex hull problem is one of the fundamental problems in computer graphics, image processing, CAD/ CAM and pattern recognition. In this paper, the properties of the convex hull are investigated and a new algorithm for the convex hull based on its properties is presented. The algorithm divides the convex polygon into several segments by the extreme points, and then computes the convex hull points of every segment. The theoretical analysis and experimental results show that the proposed algorithm is in correct and high efficiency.