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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Lin, JC	en_US
dc.contributor.author	Lin, JY	en_US
dc.date.accessioned	2014-12-08T15:48:57Z	-
dc.date.available	2014-12-08T15:48:57Z	-
dc.date.issued	1998-06-01	en_US
dc.identifier.issn	1057-7149	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/83.679445	en_US
dc.identifier.uri	http://hdl.handle.net/11536/32567	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.subject	bottom path	en_US
dc.subject	convex Hull	en_US
dc.subject	parallel	en_US
dc.subject	slopes	en_US
dc.subject	top path	en_US
dc.title	A 1 logN parallel algorithm for detecting convex Hulls on image boards	en_US
dc.type	Letter	en_US
dc.identifier.doi	10.1109/83.679445	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON IMAGE PROCESSING	en_US
dc.citation.volume	7	en_US
dc.citation.issue	6	en_US
dc.citation.spage	922	en_US
dc.citation.epage	925	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000073773000018	-
dc.citation.woscount	1	-
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.