A New Algorithm for Finding Convex Hull Based on Intelligent Approximating with a Maximum Pitch of Base Lines
基于最大基线倾角智能逼近的凸壳新算法

In this paper,comment on a representative algorithm convex hull with half-dividing and recurrenc;and a more efficient new algorithm to find a convex hull based on intelligent approximating with a maximum pitch is given by the isomorphic fundamental theorem of the convex hull.The isomorphic characters of the new algorithm are:1)find out the outside-most poles which are the leftmost,rightmost,topmost and bottommost points on the convex hull,i.e. the four initial poles which have the maximum or the minimum coordinate value of the X or Y axis among all the points in given 2D point set;2)divides the original distributed domain into four sub-domain with the initial poles;3) in every sub-domain,constructs a current pole with a maximum pitch to its base line based on its last pole got just dynamically and sequentially,and draw the rims of this convex polygon with these poles for intelligent approximating for a convex hull of the given 2D point set step by step.