A PRIORI FILTRATION OF POINTS FOR FINDING CONVEX HULL
提出一种先验过滤点集的方法，以提高现有凸包算法的效率，并基于此创建了两个新算法，实验证明其高效性。
Convex hull is the minimum area convex polygon containing the planar set. By now there are quite many convex hull algorithms (Graham Scan, Jarvis March, QuickHull, Incremental, Divide‐and‐Conquer, Marriage‐before‐Conquest, Monotone Chain, Brute Force). The main attention while choosing the algorithm is paid to the running time. In order to raise the efficiency of all the algorithms an idea of a priori filtration of points is given in this article. Besides, two new algorithms have been created and presented. The experiment research has shown a very good efficiency of these algorithms.