A 1 logN parallel algorithm for detecting convex Hulls on image boards

Title:	A 1 logN parallel algorithm for detecting convex Hulls on image boards
Authors:	Lin, JC Lin, JY 資訊工程學系 Department of Computer Science
Keywords:	bottom path;convex Hull;parallel;slopes;top path
Issue Date:	1-Jun-1998
Abstract:	By finding the maximum and minimum of {y(i) - mx(i) 1 less than or equal to i less than or equal to 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 hoard. The mathematical theory needed is included, and computation time is 1 log N.
URI:	http://dx.doi.org/10.1109/83.679445 http://hdl.handle.net/11536/32567
ISSN:	1057-7149
DOI:	10.1109/83.679445
Journal:	IEEE TRANSACTIONS ON IMAGE PROCESSING
Volume:	7
Issue:	6
Begin Page:	922
End Page:	925
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.