標題: A 1 logN parallel algorithm for detecting convex Hulls on image boards
作者: Lin, JC
Lin, JY
資訊工程學系
Department of Computer Science
關鍵字: bottom path;convex Hull;parallel;slopes;top path
公開日期: 1-六月-1998
摘要: 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
期刊: IEEE TRANSACTIONS ON IMAGE PROCESSING
Volume: 7
Issue: 6
起始頁: 922
結束頁: 925
顯示於類別:期刊論文


文件中的檔案:

  1. 000073773000018.pdf