| dc.contributor.author | Kuzmin, Yevgeni P. | en_US |
| dc.date.accessioned | 2014-10-21T06:18:38Z | |
| dc.date.available | 2014-10-21T06:18:38Z | |
| dc.date.issued | 1990 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.1990.tb00424.x | en_US |
| dc.description.abstract | An efficient incremental circledrawing algorithm which uses paired update of the decision variable is proposed. The output of the algorithm is identical to the output of Bresenham s algorithm but the total number of arithmetical operations is less. Efficiency of the algorithm is independent of the output devices. Its other advantages are discussed. | en_US |
| dc.publisher | Blackwell Publishing Ltd and the Eurographics Association | en_US |
| dc.title | An Efficient Circle-Drawing Algorithm | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 9 | en_US |
| dc.description.number | 4 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.1990.tb00424.x | en_US |
| dc.identifier.pages | 333-336 | en_US |
