%0 Journal Article
%T A New Algorithm for Finding Convex Hull Based on Intelligent Approximating with a Maximum Pitch of Base Lines<br>基于最大基线倾角智能逼近的凸壳新算法
%A ZHOU Qi-Hai
%A HUANG Tao
%A WU Hong-Yu
%A ZHANG Yuan-Xin
%A <br>周启海
%A 黄涛
%A 吴红玉
%A 张元新
%J 计算机科学
%D 2007
%I 
%X In this paper,comment on a representative algorithm convex hull with half-dividing and recurrenc;and a more efficient new algorithm to find a convex hull based on intelligent approximating with a maximum pitch is given by the isomorphic fundamental theorem of the convex hull.The isomorphic characters of the new algorithm are:1)find out the outside-most poles which are the leftmost,rightmost,topmost and bottommost points on the convex hull,i.e. the four initial poles which have the maximum or the minimum coordinate value of the X or Y axis among all the points in given 2D point set;2)divides the original distributed domain into four sub-domain with the initial poles;3) in every sub-domain,constructs a current pole with a maximum pitch to its base line based on its last pole got just dynamically and sequentially,and draw the rims of this convex polygon with these poles for intelligent approximating for a convex hull of the given 2D point set step by step.
%K Isomorphic
%K Convex hull algorithm
%K Distributed domain
%K Pitch of base Lines
%K Intelligent approximating<br>同构化
%K 凸壳算法
%K 分布域
%K 最大倾角
%K 智能逼近
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=E594E7E45E80A4AC&yid=A732AF04DDA03BB3&vid=339D79302DF62549&iid=9CF7A0430CBB2DFD&sid=9F6DA927E843CD50&eid=3D9746C06EC12B45&journal_id=1002-137X&journal_name=计算机科学&referenced_num=7&reference_num=18