| 求两个不相交凸多边形公共支撑线的改进算法 |
| |
| 引用本文： | 傅清祥,王晓东.求两个不相交凸多边形公共支撑线的改进算法[J].福州大学学报(自然科学版),1990(4):6-11. |
| |
| 作者姓名： | 傅清祥 王晓东 |
| |
| 作者单位： | 福州大学计算机系
(傅清祥)，福州大学计算机系(王晓东) |
| |
| 摘 要： | 本文提出了一个求两个不相交凸多边形公共支撑线的算法，证明了它的正确性，表明它 改进了文［１］中提出的相应算法．
|
| 关 键 词： | 计算几何 凸多边形 支撑线 |
An Improved Algorithm for Finding the Common Supporting Lines of Two Disjoint Convex polygons |
| |
| Fu Qingxiang Wang Xiaodong.An Improved Algorithm for Finding the Common Supporting Lines of Two Disjoint Convex polygons[J].Journal of Fuzhou University(Natural Science Edition),1990(4):6-11. |
| |
| Authors: | Fu Qingxiang Wang Xiaodong |
| |
| Institution: | Department or Computer Science |
| |
| Abstract: | An algorithm for finding the common supporting lines of two disjoint convex polygons is presented. Its correctness has been verified and the computational complexity ana- lysed. The result shows that the algorithm improves the analogous one suggested in literature 1]. |
| |
| Keywords: | computational geometry convex polygon supporting line |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
