直線生成算法,尤其是直線掃描轉(zhuǎn)換算法,是計(jì)算機(jī)圖形學(xué)和計(jì)算機(jī)輔助設(shè)計(jì)等領(lǐng)域最基本、最重要的算法之一。本文提出了一種改進(jìn)的直線生成算法——直線掃描轉(zhuǎn)換的五步生成算法。該算法過給定的直線的始點(diǎn)和終點(diǎn),可以一次計(jì)算得到并且點(diǎn)亮五個象素點(diǎn),從而較傳統(tǒng)的直線掃描轉(zhuǎn)換算法成倍地提高了直線的生成速度,與著名的“四步法”相比,幾乎沒有增加復(fù)雜性,而速度則提高約20% , 同時仍然保持傳統(tǒng)直線掃描轉(zhuǎn)換算法的精度。
關(guān)鍵詞：Bresenham 算法,直線生成算法,五步法,掃描轉(zhuǎn)換。
A Quick Generating Algorithm for Line Scan Conversion OUYANG Kaicui，BAI Baogang，ZENG Linghua School of Computer Science & Engineering, Wenzhou University, Wenzhou 325027 Abstract：Line generating algorithm, especially line scan conversion, is one of the most important and basic algorithms in computer graphics and computer aided design. This paper presents an improved approach for line generating algorithm, five-step generating algorithm for line scan conversion of raster graphics. This algorithm lights five pixels in a loop between the coordinate information of line’s start and end points. Therefore, the speed
of generating of straight line can be accelerated. Compared with the four-step, it is the speed that increased by about 20% while the complexity is almost the same. Meanwhile the five-step still maintains the precise of the traditional line scan conversion algorithm.
Keyword：Bresenham algorithm, line generating algorithm, five-step generating algorithm, scan conversion