An Analysis and Investigation of Algorithms for Identifying Convexity-Concavity of a Simple Polygon
Cheng Chang-xiu Song Xiao-mei · Guotu ziyuan yaogan · 2011
Algorithms for identifying convexity-concavity of a simple polygon has a very important application in many fields.The authors analyzed the present popular algorithms for identifying convexity-concavity of a simple polygon such as angling method,left-right-point method,vector-area method,vector-product method,raying method,slopping method and extremity-vertices-order method.A detailed derivation of these algorithms has revealed that these algorithms can all use the formula b=p*m as the expression,and are equivalent to each other in nature;nevertheless,the pole-order method still have some problems to be further studied.Based on an analysis of the computation,the authors hold that theoretically the vector-product method,the slopping method and the raying method could be used effectively in programming.