%0 Journal Article
%T Parallel convex hull algorithm of planar point set based on PC cluster<br>平面点集凸包的并行算法研究
%A HAO Xiao-zhu
%A HU Xiang-yun
%A DAI Guang-ming
%A ZHANG Rong
%A CHNEG Hong-jie
%A <br>郝小柱
%A 胡祥云
%A 戴光明
%A 等
%J 计算机应用
%D 2005
%I 
%X The convex hull problem is one of the fundamental problem in computational geometry,and wildly used in many fields.In this paper,A new parallel algorithm was proposed by combining improved fast convex hull algorithm of planar point set based on sorted simple polygon in this paper.The worst-case time complexity of the algorithm was O(n).The algorithm used in COW parallel computing system and MPI parallel environment.Compared with the original serial algorithm,this method was viable,accurate and highly efficient.
%K convex hull of point set
%K parallel algorithm
%K COW
%K MPI<br>点集凸包
%K 并行算法
%K 机群
%K 消息传递界面
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=1CEC0688C547B996&yid=2DD7160C83D0ACED&vid=C5154311167311FE&iid=F3090AE9B60B7ED1&sid=8E0C39B4535F0285&eid=8C5000880BA36CC7&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=17