A New Fast Convex Hull Algorithm Based On The Rectangular Segmentation

Computing the convex hull of any given point set is a fundamental problem in computational geometry. In this paper, a new algorithm is proposed to improve the efficiency of the creation of convex hull. The algorithm employed a rectangular segmentation method to divide the initial convex hull with some rectangular windows, then most of non-convex points could be easily removed out by comparing their coordinate values in order to reduce the computation time of the creation procedure. To validate the efficiency, three computer experiments were conducted and the results showed that the proposed algorithm has better performance than some other present convex hull algorithms such as Quickhull algorithm when dealing with the large scale two dimension scattered point set.