New Algorithm for Convex Hull of Planer Point Set
Wei Li Pan · Journal of Chongqing Institute of Technology · 2009
This article presents a new algorithm for the convex hull of planer point set.First,it distills a minimum quadrangle and sorts the points in the point set.The points in the quadrangle are deleted and the residual points are compartmentalized into different sections.Then it is determined that the largest point of the angle formed between points in various sections and the peak point of the minimum quadrangle is the peak point of the hull,which serves as the peak point of next judgment.Repeating this procedure,the peak points of the hull are obtained,and the null of the point set forms by connecting these peak points together in order.