Title of article
A 1 log N parallel algorithm for detecting convex hulls on image boards
Author/Authors
Ja-Chen Lin، نويسنده , , Jenn-Yih Lin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
4
From page
922
To page
925
Abstract
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.
Keywords
Convex hull , Parallel , top path. , slopes , Bottom path
Journal title
IEEE TRANSACTIONS ON IMAGE PROCESSING
Serial Year
1998
Journal title
IEEE TRANSACTIONS ON IMAGE PROCESSING
Record number
396051
Link To Document