| 求平面点集凸壳算法 |
| |
| 引用本文： | 李旭朝.求平面点集凸壳算法[J].兰州工业高等专科学校学报,2011,18(2):16-18. |
| |
| 作者姓名： | 李旭朝 |
| |
| 作者单位： | 兰州交通大学数理与软件工程学院,甘肃,730070 |
| |
| 摘 要： | 在分析传统平面点集凸壳算法的基础上,给出了一种新的平面点集凸壳算法,对算法步骤进行了详细说明,并对此算法可行性进行了验证,最后对算法时间复杂度进行了分析探讨,得到了很好的效果.
|
| 关 键 词： | 极值点 夹角 子集 凸壳算法 |
Planar Convex Hull Algorithm |
| |
| LI Xu-zhao.Planar Convex Hull Algorithm[J].Journal of Lanzhou Higher Polytechnical College,2011,18(2):16-18. |
| |
| Authors: | LI Xu-zhao |
| |
| Affiliation: | LI Xu-zhao(Institute of Mathematics and Software Engineering,Lanzhou Jiaotong University,Lanzhou 730070,china) |
| |
| Abstract: | 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. |
| |
| Keywords: | Extreme point angle subset Convex Hull Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
