基于自适应步长的直线生成算法  

Self-adaptive step straight-line algorithms

作　　者：黄斌茂[1] 张利[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《清华大学学报（自然科学版）》2006年第10期1719-1722,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金资助项目(60172027)

摘　　要：为了改进计算机图形学中画线算法的效率,提出一种基于自适应步长的直线生成算法和一种集成了对称性、最大公约数和自适应步长的集成算法。由于直线仅包含一种或两种与斜率有关的像素模式,算法利用这一特性,自适应地采用最佳步长,在单次判决中生成多个像素。通过综合使用直线像素的中点对称性、最大公约数性质以及像素模式的有限性等3种相互独立的特性,集成算法在单次判决中可生成更多像素。算法的仿真结果表明:新算法生成直线的效率更高、速度更快。Line drawing algorithm in computer graphics systems is improved with a self-adaptive step straight-line algorithm and another integrated algorithm that combines self-adaptive step algorithm with the symmetry and greatest common divisor （GCD）-based algorithms. The self-adaptive step algorithm uses the limited pixel patterns inherent in line segments to adaptively determine the best step that corresponds to the line slope and then generates multi-pixels in each judgement. The integrated algorithm utilizes the symmetry, GCD, and limited pixel patterns and generates more pixels in each cycle. Comparisons with Bresenham＇s algorithm show that the integrated algorithms are more effective and efficient.

关 键 词：BRESENHAM算法 自适应步长 对称性 最大公约数 像素模式 

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