A 1 log N parallel algorithm for detecting convex hulls on image boards
Ja‐Chen Lin, Jenn-Yih Lin · IEEE Transactions on Image Processing · 1998
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.