%0 Journal Article
%T A Simple and Fast Algorithm for Detecting the Convexity and Concavity of Vertices for an Arbitrary Polygon<br>任意多边形顶点凸、凹性判别的简捷算法
%A LIU Run-tao
%A <br>刘润涛
%J 软件学报
%D 2002
%I 
%X 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.
%K polygon
%K convexity and concavity
%K algorithm
%K orientation
%K sufficient and necessary condition<br>多边形
%K 凸凹性
%K 算法
%K 走向
%K 充要条件
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=6111CF3CC216682A&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=DF92D298D3FF1E6E&sid=A2484BFF38B01808&eid=2A0592C45C936A61&journal_id=1000-9825&journal_name=软件学报&referenced_num=20&reference_num=5