An Efficient Circle-Drawing Algorithm
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.
BibTeX
@article {10.1111:j.1467-8659.1990.tb00424.x,
journal = {Computer Graphics Forum},
title = {{An Efficient Circle-Drawing Algorithm}},
author = {Kuzmin, Yevgeni P.},
year = {1990},
publisher = {Blackwell Publishing Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.1990.tb00424.x}
}
journal = {Computer Graphics Forum},
title = {{An Efficient Circle-Drawing Algorithm}},
author = {Kuzmin, Yevgeni P.},
year = {1990},
publisher = {Blackwell Publishing Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.1990.tb00424.x}
}