AN IMPROVED ALGORITHM FOR PRODUCING MINIMUM CONVEX HULL
一种改进的最小凸包生成算法

At present,there are various algorithms for producing the Minimum Convex Hull,but these algorithms consume relatively long computing time when the sum of spatial data points are more than 106.An improved algorithm which are of stability and efficiency is designed.Through scanning the data points one time,we can get two tables: Lateral Sorting Table and Longitudinal Sorting Table,and a Initial Minimum Convex Hull.After the scanning,we judge whether the current point can be classified in the Minimum Convex Hu...