Fast Algorithm for Convex Hull of Planer Point Set
Min Zhou · Journal of Information and Computational Science · 2013
The convex hull is one of main research problems in computational geometry, it has been wildly used in computer graphics, pattern recognition, image processing, GIS and military, etc. In this paper, a simple and fast algorithm for the convex hull of planer point set is proposed by deleting those “useless” points. In case of points distributed randomly in the planer area, our algorithm is more efficient than the classical Graham Scan Algorithm in terms of processing.