%0 Journal Article
%T A New Parallel Algorithm for Finding Convex Hull Based on Maximum Pitch of the Dynamical Base Line Coiling with 4-Clusters,4-Domains and 4-Directions<br>基于四群四域四向动态基线倾角最大化圈绕的凸壳并行新算法
%A ZHOU Qi-Hai
%A HUANG Tao
%A <br>周启海
%A 黄涛
%J 计算机科学
%D 2008
%I 
%X In this paper,the serial algorithm for finding convex hull based on maximum pitch of the base line coiling is improved to be the serial algorithm for finding convex hull based on maximum pitch of the dynamical base line coiling firstly; then,according to the isomorphic fundamental theorem of the convex hull construction and using the advantages of COW (Cluster of workstation),the serial algorithm for finding convex hull based on maximum pitch of the dynamical base line coiling is extended in multi-domains a...
%K Isomorphic
%K COW
%K Convex hull
%K Parallel algorithm
%K 4-Clusters
%K 4-Domains
%K 4-Directions<br>同构化
%K 机群
%K 凸壳
%K 并行算法
%K 四群
%K 四域
%K 四向
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=7A2DBEFC6ABE9F38AA849CA8C6D3D14C&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=38B194292C032A66&sid=C812B90E96151014&eid=B78CD622C1934236&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=8