直线生成算法的改进

贾银亮; 张焕春; 经亚枝

doi:10.11834/jig.20080128

计算机图形学 | 浏览量 : 0 下载量: 241 CSCD: 0

PDF
导出
分享
收藏
专辑

直线生成算法的改进
A Modified Bresenham Algorithm of Line Drawing
2008年13卷第1期页码：158
纸质出版：2008
DOI： 10.11834/jig.20080128
稿件说明：

移动端阅览

贾银亮, 张焕春, 经亚枝. 直线生成算法的改进[J]. 中国图象图形学报, 2008,13(1):158. DOI： 10.11834/jig.20080128.

A Modified Bresenham Algorithm of Line Drawing[J]. Journal of Image and Graphics, 2008, 13(1): 158. DOI： 10.11834/jig.20080128.

摘要

摘要：直线是图形的基本元素，研究其生成算法具有重要意义。由于经典的Bresenham直线生成算法一次计算只能生成一个像素点，效率较低。为了提高直线生成效率，通过对其进行改进，提出了一种利用直线前两行像素行的像素点数目来计算其余各像素行的像素点数目的算法。该算法在保持Bresenham算法不使用取整和小数运算的优点下，还提高了直线生成效率，一次计算可以生成一个像素行。

Abstract

Abstract：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.