说明：  ：凸包问题是计算几何的基本问题，在实l~．X-程中得到了广泛的应用。传统 的凸包生成算法一般需要两个步骤，首先将离散点按照某种特性排序，然后进行凸包生成。 依据快速排序算法的思想，提出一种“一步法”构建平面点集凸包的算法，将构建平面点集 的凸包问题与排序问题结合起来，在排序过程中快速生成点集凸包。整个过程达到时间复杂 度下限O(nlogn)。该算法在“河北省蓄滞洪区信息管理系统”中得到了实际应用，效果理想
(: Convex hull problem is that the basic problem in computational geometry, in real l ~. X-process has been widely used. The traditional convex hull generation algorithm generally requires two steps, first sort the features according to some discrete points, then the convex hull generated. Fast sorting algorithm based on the idea, put forward a " one-step" building planar point set convex hull algorithm, will build the convex hull of planar point set problems and scheduling problems together in order to quickly generate points during the convex hull. Time complexity of the process to limit O (nlogn). The algorithm in the " Hebei flood information management system" has been applied in, the results are satisfactory)