确定任意多边形顶点凸凹性的快速算法  

An Algorithm for Rapidly Determining the Convexity Concavity of the Vertices of an Arbitrary Polygon

作　　者：许如初 张智平 

机构地区：[1]计算机科学与工程系 [2]中国农业银行干部管理学院 [3]华中理工大学计算机科学与工程系

出　　处：《华中理工大学学报》1997年第1期103-104,共2页Journal of Huazhong University of Science and Technology

摘　　要：给出了一种确定任意多边形顶点凸凹性的快速算法．An algorithm for rapidly determining the convexity concavity of the vertices of an arbitrary polygon is given. The properties of the convex vertex is proposed and proved. The basic idea is discussed and the procedures described. The results show that the complexity of the computing time of the algorithm is a linear function of the number of the vertices of the given polygon.

关 键 词：多边形 顶点 凸凹性 算法 时间复杂度 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]