摘要
现有基于不规则三角网的等值线填充算法较少,且不能精确判断区域颜色。对此给出一种通过不规则三角网快速填充等值线图的算法,搜索出所有开区域轮廓,通过围成区域等值线属性值与不同颜色的对应关系确定区域颜色,采用深度优先的方法对开区域及其内部的多级封闭区域进行矢量填充。对不同数据源运行该算法,并与其他算法进行比较,根据对比结果可知该算法比现有算法更适合于基于三角网生成的等值线图精确填充。
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.
出处
《计算机应用与软件》
CSCD
2016年第10期265-269,共5页
Computer Applications and Software
基金
云南省应用基础研究计划项目(2013FZ021)
关键词
等值线图
颜色填充
三角网
对应关系
深度优先
Contour map
Color filling
Triangulation network
Corresponding relations
Depth-first
