title: A 1 log N parallel algorithm for detecting convex hulls on image boards.
abstract: By finding the maximum and minimum of {yi-mxi|1=or<i=or<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.
authors.affiliation: Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, ROC. jclin@cis.nctu.edu.tw
authors.forename: J C
authors.initials: JC
authors.lastname: Lin
authors.forename: J Y
authors.initials: JY
authors.lastname: Lin