摘要: 针对六角网格系统下图形、图像处理及显示时像素之间相邻的唯一性,提出六角网格系统下的多边形填充算法,其中包括边界填充算法和扫描线填充算法,采用图示与伪代码的方法描述算法。与矩形网格上的图像处理算法相比,六角网格系统上的图像处理算法具有更好的唯一性和简便性。
关键词:
六角网格,
邻接性,
填充,
边界,
扫描线
Abstract: For the unique connective characteristic of the graphics display and image processing on the hexagonal grids, this paper presents the polygon-fill algorithm on the hexagonal grids, including the boundary-fill algorithm and scan-line fill algorithm. It uses icons and the false code to describe the two algorithms. The results prove that the uniqueness and simplicity of polygon-fill algorithm on the hexagonal grids make it superior to that on the square grids.
Key words:
hexagonal grids,
connective characteristic,
fill,
bound,
scan-line
中图分类号:
邹黎黎;唐 棣. 六角网格系统下的多边形填充算法[J]. 计算机工程, 2009, 35(15): 224-226.
ZOU Li-li; TANG Di. Polygon-fill Algorithm on Hexagonal Grids System[J]. Computer Engineering, 2009, 35(15): 224-226.