Algorithm for Convex Hull of Planar Massive Scattered Point Set
Xincai Wu · Jisuanji gongcheng · 2009
Being a basic structure of computational geometry,convex hull is important to data analysis of GIS.Based on the analysis of traditional convex hull algorithm,a new convex hull algorithm is presented,i.e.pyramid algorithm.It adopts three fast algorithms simultaneously to improve execution efficiency.Comparison of much experiment data shows that the algorithm is very efficient for calculating convex hull of planar massive scattered point set,and for the point set of 107 level,its execution time on a 2.00 GHz personal computer is only three to four seconds.