| 一种简单多边形凸包的快速算法及程序设计 |
| |
| 引用本文： | 周文科.一种简单多边形凸包的快速算法及程序设计[J].广州大学学报(自然科学版),2003,2(6):545-547,559. |
| |
| 作者姓名： | 周文科 |
| |
| 作者单位： | 广州大学,计算机教育软件研究所,广东,广州,510405 |
| |
| 摘 要： | 给出了一种求简单多边形凸包的快速算法，此算法采取将各个点按与X轴的夹角顺次排列，然后逐渐地删除凹顶点，求得简单多边形的凸包，并给出了算法的数据结构．算法达到了O(nlogn)的理论时间复杂度下限．
|
| 关 键 词： | 凸包 算法 简单多边形 |
| 文章编号： | 1671-4229(2003)06-0545-03 |
An accelerating algorithm for computing convex hull of simple polygon |
| |
| ZHOU Wen-ke.An accelerating algorithm for computing convex hull of simple polygon[J].Journal og Guangzhou University:Natural Science Edition,2003,2(6):545-547,559. |
| |
| Authors: | ZHOU Wen-ke |
| |
| Abstract: | This paper focuses on an accelerating algorithm for computing convex hulls of s-polygon, which, at first, arranges all given points according to angle between X-axis and themselves, deletes gradually concave points. We get convex hulls of s-polygon, moreover, and we describe the data-structure of algorithm in details in the paper. Its time-complexity, in theory, is O(nlogn). |
| |
| Keywords: | convex hull algorithm simple polygon |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
