计算机应用与软件2016，Vol.33Issue(10)：265-269,5.DOI:10.3969/j.issn.1000-386x.2016.10.059
基于不规则三角网的等值线填充算法
THE CONTOUR FILLING ALGORITHM BASED ON TRIANGULATED IRREGULAR NETWORK
摘要
Abstract
Currently,there are little contour filling algorithm based on triangulated irregular network,and have trouble in judging color regions accurately.In this case,an algorithm of filling contour map rapidly by triangulated irregular network is proposed to search for outlines of all open regions.Then the region color is confirmed by the corresponding relationship between the attribute value of isograms and different colors,and the multistage closed region of open regions and its inside is filled with vectors by using the method of deep optimization.After running the algorithm on different data sources and comparing with other algorithms,it is learned that the proposed algorithm is more suitable to fill contour map generated by triangulated network accurately than other existing algorithms.关键词
等值线图/颜色填充/三角网/对应关系/深度优先Key words
Contour map/Color filling/Triangulation network/Corresponding relations/Depth-first分类
信息技术与安全科学引用本文复制引用
杨玺,吴晟,李英娜,李川..基于不规则三角网的等值线填充算法[J].计算机应用与软件,2016,33(10):265-269,5.基金项目
云南省应用基础研究计划项目（2013FZ 021）。 （）
