A PRIORI FILTRATION OF POINTS FOR FINDING CONVEX HULL
Laura Vyšniauskaitė, Vydūnas Šaltenis · Technological and Economic Development of Economy · 2006
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.