摘要
给出了一种确定任意多边形顶点凸、凹性的简捷算法.该算法只需要2n+4次乘法,5n+10次加、减法及2n+3次比较即可完成(n是多边形顶点的个数).同时,给出了任意简单多边形走向的充要条件.
A simple and fast algorithm for detecting the convexity and concavity of vertices for an arbitrary polygon is presented, which needs 2n+4 multiplications, 5n+10 additions or subtractions and 2n+3 comparisons (n is the number of the vertices of the polygon). Meanwhile, the sufficient and necessary condition for the orientation of an arbitrary simple polygon is given.
出处
《软件学报》
EI
CSCD
北大核心
2002年第7期1309-1312,共4页
Journal of Software
基金
国家自然科学基金资助项目(69705004
10171025)
黑龙江省自然科学基金资助项目(F9706)
关键词
任意多边形顶点
简捷算法
凸凹性
模式识别
图像处理
polygon
convexity and concavity
algorithm
orientation
sufficient and necessary condition
