摘要
现有的绘制曲线的算法都是单步的。提出了一个双步绘制曲线的通用算法,算法的每一步可以绘制两个像素点。以三次Bezier曲线的绘制为例给出了具体实现过程。给出了算法的伪代码过程。给出了算法的计算量比较结果。结果表明提出的双步算法与单步算法相比,计算量有了较大幅度的减少。
The existing curve-drawing algorithms are single step. A double-step commonly used algorithm for drawing curves is presented in this paper. In each step of the algorithm two pixels are drawn. As an example, the realization process for cubic Bezier curve is given. A pseudo code of the algrithm is given. The results of the calculation comparison between the algrithms are given. The results show that the calculation of the proposed double-step algorithm is much less than that of the single-step algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2015年第2期171-176,共6页
Computer Engineering and Applications
基金
辽宁省科技基金项目(No.201102042)
中央高校基本科研业务费专项资金资助
辽宁省教育厅科研项目
关键词
像素
曲线
区域
递推
双步
pixels
curve
region
recursive
double-step
