摘要
文章提出了一种对平面离散点集凸壳的快速算法,该算法首先对离散点进行扫描线方式排序,构造初始凸壳,然后把剩下的离散点加入到已有的凸壳中生成新的凸壳。实验表明该算法具有很好的效率。
A fast algorithm for convex hull of the planar points is presented. The algorithm firstly makes the discrete points sorted in scan manner, construct the initial convex hull, then add the rest of the discrete points to the convex hull which has been created and generate a new convex hull. Experiments show that the algorithm has a good efficiency.
出处
《电脑与信息技术》
2008年第3期34-35,52,共3页
Computer and Information Technology
关键词
凸壳
计算几何
快速排序
convex hull
computational geometry
guick sort
