| 摘要: |
| 给出了一种确定任意多边形顶点凸、凹性的简捷算法.该算法只需要2n+4次乘法,5n+10次加、减法及2n+3次比较即可完成(n是多边形顶点的个数).同时,给出了任意简单多边形走向的充要条件. |
| 关键词: 多边形 凸凹性 算法 走向 充要条件 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金资助项目(69705004,10171025);黑龙江省自然科学基金资助项目(F9706) |
|
| A Simple and Fast Algorithm for Detecting the Convexity and Concavity of Vertices for an Arbitrary Polygon |
|
LIU Run-tao
|
| Abstract: |
| 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. |
| Key words: polygon convexity and concavity algorithm orientation sufficient and necessary condition |
