简单快速的平面散乱点集凸包算法

凸包问题是计算几何的基本问题之一，在许多领域均有应用，传统点集凸包算法和简单多边形凸起算法平行发展，互不相干，文中将简单多边形凸包算法应用用于散乱点集凸包问题中，提出了新的点集凸包算法，新算法不仅达到了Ｏ（ｎｌｏｇｎ）的理论时间复杂度下限，而且极其简单，易于实现，该算法已应用于工厂设计软件ＰＤＳＯＦＴ中，实践证明效果很好。

Simple Fast Convex Hull Algorithm of Planar Point Set

Convex hull problem is one of the fundamental problems incomputational geometry,and used in many fields. The traditional convex hull algorithms of point set and that of simple polygons have parallelly developed without any combination. In this paper, a new algorithm is proposed based on combining the convex hull algorithms of simple polygons into solving the problem of point set. The algorithms in this paper not only reaches the lower bound of O( n log n ),but also is very simple and easy to be realized. The presented algorithms has been applied in plantdesign system of PDSOFT.The results obtained by the method areremarkable.