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)$。