基于并行填充模式的直线生成算法  

Line Generating Algorithm Based on the Mode of Parallel Filling

作　　者：韩玫瑰[1] 刘明军[1] 董学仁[2] 

机构地区：[1]济南大学信息科学与工程学院,山东济南250022 [2]济南大学科技处,山东济南250022

出　　处：《济南大学学报（自然科学版）》2004年第3期212-214,共3页Journal of University of Jinan(Science and Technology)

基　　金：国家自然科学基金资助项目 ( 60 172 0 49)

摘　　要：提出一种新的直线生成算法 ,该算法不需像传统的Bresenham算法那样对每个象素点进行偏差计算 ,而是根据已知的直线起点和终点坐标信息 ,确定在每个象素行上一次填充象素点的点数 ,然后以此为基本单位逐行填充。利用此算法可并行写入并点亮多个象素点 ,加快了直线生成速度 ,同时算法简练 。We brought forward a new line generating algorithm.The algorithm needs not to calculate every pixel's deviation like the traditional Bresenham's doing.It decides the number of pixel once filled in every pixel's row according to the coordinate information of line's start point and end point.This is the size of one pattern and then we fill every row in a unit of pattern.In the paper,we fully discussed the many probable cases of the pattern will be. By using this algorithm,many pixels can be written in and lighted in parallel.It can quicken the speed of line's generating and be easy for hard realization.Meanwhile the algorithm is simple and has a high executing efficiency.

关 键 词：并行 循环 BRESENHAM算法 偏差 

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