A 1 log N parallel algorithm for detecting convex hulls on image boards

By finding the maximum and minimum of fyi 􀀀 mxi j 1 i Ng 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 logN.