提出一种圆弧绘制算法.与传统的基于单个像素点的圆弧绘制算法不同,新算法每执行一次输出操作均可生成两个或多个像素点.该算法将圆弧离散轨迹看成是由一系列水平位移和对角位移构成,逐段找出并绘制这些位移,从而减少了圆弧绘制过程中所需的输出操作,有效地提高了圆弧绘制速度.实验结果表明,新算法与著名的Bresenham算法相比,圆弧绘制速度提高近一倍.进一步地,新算法可以推广到其他二次曲线的绘制中

An algorithm for the drawing of circles is proposed in this paper. It differs greatly from the conventional algorithms that select one pixel per iteration because it can generate at least two pixels every time an I/O operation is executed. The algorithm is presented on the observation that the discrete loci of a circle are composed of a series of horizontal displacements and diagonal displacements. By locating and drawing these displacements one by one, the algorithm can effectively increase the speed of circle drawing due to the great reduction in the number of I/O operations. The experiment results prove that the circle-drawing speed of the algorithm can be almost doubled comparing with of the Bresenham algorithm. Furthermore, the algorithm can be generalized to the production of other conics in computer graphics.

国家自然科学基金资助项目(69878038);国家863高科技发展计划资助项目(863-511-9842-006);浙江省自然科学基金资助项目(696045)