The Incremental Display of a Single-Valued Curve
| dc.contributor.author | Smith, F.J. | en_US |
| dc.contributor.author | Leitch, S. | en_US |
| dc.date.accessioned | 2014-10-21T06:09:10Z | |
| dc.date.available | 2014-10-21T06:09:10Z | |
| dc.date.issued | 1989 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.description.number | 2 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 8 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.1989.tb00471.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 159-165 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.1989.tb00471.x | en_US |
| dc.publisher | Blackwell Publishing Ltd and the Eurographics Association | en_US |
| dc.title | The Incremental Display of a Single-Valued Curve | en_US |