摘要
本文提出了一个求两个不相交凸多边形公共支撑线的算法，证明了它的正确性，表明它 改进了文［１］中提出的相应算法．
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].
出处
《福州大学学报（自然科学版）》
CAS
CSCD
1990年第4期6-11,共6页
Journal of Fuzhou University(Natural Science Edition)
关键词
算法
凸多边形
计算几何
支撑线
computational geometry
convex polygon
supporting line
