全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
软件学报  2002 

A Simple and Fast Algorithm for Detecting the Convexity and Concavity of Vertices for an Arbitrary Polygon
任意多边形顶点凸、凹性判别的简捷算法

Keywords: polygon,convexity and concavity,algorithm,orientation,sufficient and necessary condition
多边形
,凸凹性,算法,走向,充要条件

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133