A Direct Filling Algorithm of Isogram in Complex Boundary

摘要：

　　On basis of summarizing the existing isogram filling algorithm,this paper pats forwards a direct filling algorithm of isogram in complex boundary.Compared with the point-by-point scanning mcthod and algorithm of area filling,this new algorithm has no necessity not only in point-by-point calculation of interpolation,but also in tracing inclusion relation between equivalent areas and determination areas,which makes filling speed faster.It is proved with practice that the new method can fill isopleth map in milliseconds.

关键词： isogram complex boundary scanning line filling algorithm

作者: Linna Huang Guangzhong Liu

作者单位: Department of Computer Engineering Cangzhou Normal University Cangzhou, China Department of Computer Engineering Hebei Engineering and Technical College Cangzhou, China

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer and Information Applications(ICCIA2012)(2012第二届计算机和信息应用国际会议)

会议地点: 太原

会议语种:英文

页码: 804-806

在线出版日期: 2012-12-08（万方平台首次上网日期，不代表论文的发表时间）