作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (15): 224-226. doi: 10.3969/j.issn.1000-3428.2009.15.078

• 图形图像处理 • 上一篇    下一篇

六角网格系统下的多边形填充算法

邹黎黎,唐 棣   

  1. (辽宁师范大学计算机与信息技术学院,大连 116029)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-08-05 发布日期:2009-08-05

Polygon-fill Algorithm on Hexagonal Grids System

ZOU Li-li, TANG Di   

  1. (College of Computer and Information Technology, Liaoning Normal University, Dalian 116029)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-08-05 Published:2009-08-05

摘要: 针对六角网格系统下图形、图像处理及显示时像素之间相邻的唯一性,提出六角网格系统下的多边形填充算法,其中包括边界填充算法和扫描线填充算法,采用图示与伪代码的方法描述算法。与矩形网格上的图像处理算法相比,六角网格系统上的图像处理算法具有更好的唯一性和简便性。

关键词: 六角网格, 邻接性, 填充, 边界, 扫描线

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

中图分类号: