%0 Journal Article
%T A Convex Hull Algorithm Based on Convex Polygon<br>基于凸多边形的凸壳算法
%A ZHANG Xian-Quan
%A LIU Li-Na
%A TANG Zhen-Jun
%A <br>张显全
%A 刘丽娜
%A 唐振军
%J 计算机科学
%D 2006
%I 
%X Convex hull problem is one of the fundamental problems in computer graphics, image processing, CAD/ CAM and pattern recognition. In this paper, the properties of the convex hull are investigated and a new algorithm for the convex hull based on its properties is presented. The algorithm divides the convex polygon into several segments by the extreme points, and then computes the convex hull points of every segment. The theoretical analysis and experimental results show that the proposed algorithm is in correct and high efficiency.
%K Convex hull
%K Monotonic segment
%K Computation geometry<br>凸壳
%K 单调段
%K 计算几何
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=606725FB2AED2369&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=9CF7A0430CBB2DFD&sid=AD16A18DBD734D13&eid=78F0EFE028BD3783&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=10