摘要
在分析传统平面点集凸壳算法的基础上,给出了一种新的平面点集凸壳算法,对算法步骤进行了详细说明,并对此算法可行性进行了验证,最后对算法时间复杂度进行了分析探讨,得到了很好的效果.
Based on the analysis of the traditional convex hull algorithm for planar point set,a new algorithm was given.The steps of the algorithm is described in detail,the feasibility of this algorithm is verified,and the time complexity of algorithm is analyzed and discussed,which gets good results.
出处
《兰州工业高等专科学校学报》
2011年第2期16-18,共3页
Journal of Lanzhou Higher Polytechnical College
关键词
极值点
夹角
子集
凸壳算法
Extreme point
angle
subset
Convex Hull Algorithm
