By finding the maximum and minimum of {y/sub i/-mx/sub i/|1/spl les/i/spl les/N} for certain slopes m, we propose here a simple and fast parallel algorithm to obtain the convex hull of N arbitrarily given points on an image board, The mathematical theory needed is included, and computation time is 1 log N.
展开▼
机译：通过找到某些斜率m的{y / sub i / -mx / sub i / | 1 / spl les / i / spl les / N}的最大值和最小值，我们在这里提出一种简单而快速的并行算法来获得凸图像板上N个任意给定点的外壳，包括所需的数学理论，计算时间为1 logN。
展开▼
