一种利用锥确定多边形顶点凹凸性的方法

摘要

This article discusses the problem of determinin g the convexity-concavity of an arbitrary polygon based on the character of po lygon and cone and presents a new method. The results show that the complexity o f the computing time of the method is a linear function of the number of the ver texes of the given polygon.%根据多边形的性质与锥的特性，提出了多边形顶点凹凸性 的判别准则及其新算法，该算法的时间复杂度仅是给定多边形顶点数目的线性函数。