摘要
针对目前尚不存在实用的整数反走样椭圆生成算法问题,利用修改的Bresenham算法,提出了一个完全利用整数运算实现的像素级反走样椭圆逐点绘制算法.该算法根据Bresenham算法中的误差控制参数产生候选点与理想直线间的精确距离,舍弃作用微小的高阶小量,利用整数比较法或查表法计算最近的两个像素的亮度.新算法将Bresenham椭圆生成与反走样统一在一个框架下,反走样绘制仅在Bresenham基本生成算法基础上进行局部调整.分析结果表明,该方法结构简单,且因为仅使用整数基本运算实现,因此具有快速的生成速度和较高的显示质量.
For the present lack in effective integer anti-aliased ellipse generating algorithm,a pixel level anti-aliased ellipse drawing algorithm realized completely using integer operation was proposed based on the modified Bresenham algorithm. The accurate distance between the candidate point and idea line was generated according to the error control parameters of Bresenham algorithm, and the higher-order infinitesimal with little effect was rejected. The lightness of the nearest pixel was calculated using either integer comparison or looking-up table methods. The new algorithm united Bresenham ellipse generating and anti-aliased drawing in a framework. The anti-aliased drawing only performed a local adjustment on the basis of Bresenham basic generating algorithm. The analysis results show that the new algorithm has simple structure,rapid generation speed and high display quality due to the use of integer operation only.
出处
《沈阳工业大学学报》
EI
CAS
2010年第3期316-320,348,共6页
Journal of Shenyang University of Technology
基金
辽宁省科学技术计划资助项目(2007410003)
关键词
反走样
椭圆生成
圆生成
整数运算
逐点绘制
BRESENHAM算法
曲线绘制
亮度转换
anti-aliased
ellipse generating
circle generating
integer operation
pixel-level drawing
Bresenham algorithm
curve drawing
lightness conversion
