An Efficient Circle-Drawing Algorithm

Simple item page
dc.contributor.authorKuzmin, Yevgeni P.en_US
dc.date.accessioned2014-10-21T06:18:38Z
dc.date.available2014-10-21T06:18:38Z
dc.date.issued1990en_US
dc.description.abstractAn 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.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume9en_US
dc.identifier.doi10.1111/j.1467-8659.1990.tb00424.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages333-336en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1990.tb00424.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleAn Efficient Circle-Drawing Algorithmen_US
Files
Collections
Issue 4