直线生成的像素行算法  

Straight line generation algorithm based on pixel line

作　　者：厉玉蓉[1] 董付国[1] 刘岩[1] 牛翠霞[1] 

机构地区：[1]山东工商学院计算机科学与技术学院,烟台264005

出　　处：《中国图象图形学报》2011年第10期1896-1899,共4页Journal of Image and Graphics

基　　金：国家自然科学基金项目(60803048;60673153;60773053);山东省自然科学基金项目(Y2007A28);山东省高校科研发展计划项目(J10LG21)

摘　　要：在Bresenham算法基础上,采用多点画线法的思想,设计并实现了直线快速生成的像素行算法。根据相邻像素之间的增量取决于直线斜率这一特点,该算法一次生成一个像素行中所有像素点坐标。算法分析与大量实验结果均表明,在保证直线精确度与Bresenham算法相同的情况下,像素行算法减少了大量计算,提高了直线生成效率,直线与x或y坐标轴夹角α越小,算法速度就越快,提高倍数接近于1/tanα,具有较大的理论价值和实际意义。On the basis of Bresenham algorithm and other fast algorithms based on multi-pixel incremental generation method, we proposes and implements a new algorithm based on pixel line, considering that the increment between adjacent pixels is determined by the line slope. We take full advantage of the relativity between pixels in the same line, generating all pixels in a pixel line once. The new algorithm guarantees the same line precision as the Bresenham algorithm, using only integer operation and shift operations, which can give a higher speed and can easily be implemented in hardware. The smaller the angle between the line and the coordination axis is, the more efficiency this algorithm can obtain. This algorithm based on pixel line is of great significance.

关 键 词：直线生成算法 BRESENHAM算法 像素行 

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