摘要
提出了一种等值线连通区域填充算法。该算法是依据追踪后的等值线曲线端点与区域边界的拓扑关系，程序自动建立一种适应于等值线连通区域搜寻的数据结构。在该数据结构信息的关联下，实现了用表达不同意义的颜色填充区域。由于该区域是一个由矢量化线段组成的区域，从而可以实现不同比例、不同方向的变换。为图形输出提供丰富的形式和图形文件保存节约了大量空间。该方法己在ＰＣ机和工作站上实现。
An algorithm to fill contours is presented in this paper. It is based on the topological relation between extreme points of contours and border of regions. A data structure adapted to the searching of the connected region of contours is automatically created. The filling of contours (by various meaningful colors) is implemented under informational interrelations provided by the data structure. Because the region is composed of vector line segments, transformations can bemade to different scales and in different directions. Rich formats are provided for graph output and a lot of storage space is saved for graphical files. This method has been realized in PC and workstations.
出处
《成都理工学院学报》
CSCD
1999年第2期191-194,共4页
Journal of Chengdu University of Technology
关键词
等值线连通区域
拓扑关系
数据结构
充算法
connected region of contours
topological relation
data structure
