Curve-drawing algorithms for Raster displays
Curve-drawing algorithms for Raster displays
复制标题
光栅显示的曲线绘制算法
DOI：
10.1145/282918.282943
复制
发表时间：
1985
期刊：
影响因子：
--
通讯作者：
Mark Novak
中科院分区：
文献类型：
--
作者：
Jerry R. Van Aken;Mark Novak
本文介绍了在光栅显示器上绘制几何曲线的有效扫描转换算法的中点法。该方法是通用的，并用于将描述曲线的非参数方程f（x，y）= 0转换成绘制曲线的算法。避免了浮点运算和乘法等耗时的操作。由该算法产生的数字近似的最大误差是显示网格上两个相邻像素之间的距离的一半。中点法与Bresenham使用的两点法进行了比较，并被认为是更准确的（在线性误差方面）在一般情况下，而不增加所需的计算量。中点法的使用是用直线、圆和椭圆的例子来说明的。讨论了用该方法导出绘制更一般曲线类的算法所涉及的问题。
The midpoint method for deriving efficient scan-conversion algorithms to draw geometric curves on raster displays in described. The method is general and is used to transform the nonparametric equation f(x,y) = 0, which describes the curve, into an algorithms that draws the curve. Floating point arithmetic and time-consuming operations such as multiplies are avoided. The maximum error of the digital approximation produced by the algorithm is one-half the distance between two adjacent pixels on the display grid. The midpoint method is compared with the two-point method used by Bresenham, and is seen to be more accurate (in terms of the linear error) in the general case, without increasing the amount of computation required. The use of the midpoint method is illustrated with examples of lines, circles, and ellipses. The considerzations involved in using the method to derive algorithms for drawing more general classes of curves are discussed.