%0 Journal Article
%T A New Parallel Algorithm for Finding Convex Hull Based on Maximum Pitch and Distance of the Dynamical Base Line<br>基于动态基线倾角与基线距离最大化的凸壳并行新算法
%A ZHOU Qi-Hai
%A HUANG Tao
%A LIN Xun
%A LI Zhong-Jun
%A <br>周启海
%A 黄涛
%A 林珣
%A 李忠俊
%J 计算机科学
%D 2008
%I 
%X In this paper, the advantages of both the parallel algorithm thinking for finding convex hull based on maximum pitch of the dynamical base line and the serial algorithm thinking for finding convex hull based on maximum distance of the dynamical base line are integrated, and the later is extended in multi-domains and is modified in parallel, further a more efficient new parallel algorithm to find a convex hull based on maximum pitch and distance of the dynamical base line is given. The general characters of ...
%K Isomorphic
%K COW
%K Convex hull
%K Parallel algorithm
%K Pitch of the dynamical base line
%K Distance of the dynamical base line<br>同构化
%K 机群
%K 凸壳
%K 并行算法
%K 动态基线倾角
%K 动态基线距离
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=39F05038C1B7F94B16576CE6A79AB013&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=E158A972A605785F&sid=5B5B75F4854B8331&eid=002786F01A86D891&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=10