基于凸多边形的凸壳算法

确定平面点集的凸壳问题在计算机图形学、图像处理、CAD／CAM、模式识别等众多领域中有广泛的应用。本文根据凸多边形的性质构建了一种新的基于凸多边形的凸壳算法，该算法利用X、y坐标的极值将凸多边形分为几个段，应用凸壳顶点有序性，分段计算凸壳的顶点而得到凸壳。理论分析和实验结果表明，该算法运行速度快效率高，具有较强的实用性。

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.