一种堆栈式快速等值线图填充算法  

Rapid filling of isograms map based stack-characterized algorithm

作　　者：徐胜利[1,2] 

机构地区：[1]辽河油田勘探开发研究院油田开发所,辽宁盘锦124010 [2]中国科学院沈阳计算技术研究所,沈阳110004

出　　处：《计算机工程与应用》2010年第8期193-195,共3页Computer Engineering and Applications

摘　　要：等值线图在科学研究、石油地质勘探等应用中具有较重要的应用。对于生成填充的等值线图,提出了一种基于堆栈式边界扫描方法,该方法通过将填充边界特征点和等值线特征点进行统一排序,利用堆栈的先进后出的特性,得到等值线之间的拓扑关系,进而追踪出闭合连通区域;对于颜色充填,提出了一种双深度值填充方法。与其他方法相比,该方法较容易理解与实现,对矢量化图件能快速填充。Isograms map plays one relative important role in the application of science research,oil geologic exploration etc.This paper puts forward one stack based border-scanning algorithm for generating filling isograms map.Taking the advantage of stack＇s FILO （first in last out） characteristic,this method can help get isolines＇ topological relations by sorting all the isoclines＇ and filling-border＇s feature points,then closed connected regions can be traced.It also puts forward one double-depth algorithm for color-filling,which is easier for understanding and realization of filling vector graphs rapidly than other ways.

关 键 词：等值线图 堆栈式边界扫描算法 双深度值颜色填充 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]