Bresenham直线生成算法的改进  

A Modified Bresenham Algorithm of Line Drawing

作　　者：贾银亮[1] 张焕春[1] 经亚枝[1] 

机构地区：[1]南京航空航天大学自动化学院,南京210016

出　　处：《中国图象图形学报》2008年第1期158-161,共4页Journal of Image and Graphics

摘　　要：直线是图形的基本元素,研究其生成算法具有重要意义。由于经典的Bresenham直线生成算法一次计算只能生成一个像素点,效率较低。为了提高直线生成效率,通过对其进行改进,提出了一种利用直线前两行像素行的像素点数目来计算其余各像素行的像素点数目的算法。该算法在保持Bresenham算法不使用取整和小数运算的优点下,还提高了直线生成效率,一次计算可以生成一个像素行。Bresenham algorithm is the most fundamental algorithm for drawing line segments in computer graphics. Canonical Bresenham algorithm can only generate one pixel of a line each time. We proposed a new method by improving it in a novel way, which can generate pixel of a line row by row according to the first and second row of a line and inherit the advantages of Bresenham algorithm without division and decimal fraction. Finally, its efficiency has been proved to be much better than those existing methods.

关 键 词：计算机图形学 BRESENHAM算法 判定变量 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]