%0 Journal Article
%T An Improved Scan Line Polygon Filling Algorithm<br>一种改进的扫描线多边形填充算法
%A ZHANG Yu-Fang
%A LIU Jun
%A PENG Yan
%A <br>张玉芳
%A 刘君
%A 彭燕
%J 计算机科学
%D 2005
%I 
%X Typical polygon filling algorithm maiuly includes scan line filling algorithm and area marks filling algorith- m,and scan line filling algorithm suits vetor polygon filling. This paper makes some research on old and common poly- gon filling algorithm,and proposes an improved scan line polygon filling algorithm--nded filling algorithm,which has the both advantages of traditional and AET scan line polygon filling algorithm on complicated and mass data polygon filling. This algorithm adapts both list table structure and array structure,and can form unbroken filling line,and is tdrie efficiently.
%K Computer graphics
%K Polygon
%K Filling algorithm<br>计算机图形学
%K 多边形
%K 填充算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=DC067AEA52F6C9F6&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=B31275AF3241DB2D&sid=F260CE035846B3B8&eid=43608FD2E15CD61B&journal_id=1002-137X&journal_name=计算机科学&referenced_num=8&reference_num=3