Premium
The Incremental Display of a Single‐Valued Curve
Author(s) -
Smith F.J.,
Leitch S.
Publication year - 1989
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.1989.tb00471.x
Subject(s) - rounding , spline (mechanical) , raster graphics , algorithm , computer science , ramer–douglas–peucker algorithm , mathematics , integer (computer science) , computer graphics (images) , computation , structural engineering , engineering , programming language , operating system
A new algorithm is described for the drawing of a single‐valued smooth function on a raster screen. It first approximates the function by a spline, normally cubic, and then displays the spline using a combination of finite differences and a special Bresenham type algorithm in integer arithmetic. Finite difference have not been successful previously, partly because of the build up of rounding errors. We show that for a modern workstation with 32 bit‐integers these errors can be estimated and the algorithm modified to minimise their effect. The result of combining all of these factors, spline, finite differences, error control, geometry and integer arithmetic is a powerful algorithm which we believe is generally more accurate and faster than previous algorithms for smooth curves. It is worth noting that when the curve is a straight line, our algorithm becomes an extension (and minor improvement) on Bresenham's algorithm.