The present paper is concerned with a recursive algorithm as a preprocessing step to find the convex hull of $n$ random points uniformly distributed in the plane. For such a set of points, it is shown that eliminating all but $O(\log n)$ of points can derive the same convex hull as the input set. Finally it will be shown that the running time of the algorithm is $O(n)

翻译：本文针对预处理步骤中解决平面内均匀随机分布$n$个点的凸包问题提出一种递归算法。对于此类点集，研究表明剔除除$O(\log n)$个点以外的所有点，可得到与原始输入集相同的凸包。最后将证明该算法的时间复杂度为$O(n)$。