Issue No. 04 - December (1995 vol. 1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2945.485618
<p><it>Abstract</it>—Conventional algorithms for scan-conversion of circles select one pixel in each iteration. Run-length slice circle algorithms have therefore been suggested. These algorithms determine a run of pixels in each iteration. The speed of scan-conversion is therefore increased due to I/O. A hybrid approach to the scan-conversion of circles is presented. The new approach combines the advantages of the two methods into a hybrid algorithm. Speedup is achieved in the hybrid algorithm not only due to the reduction in the number of I/O operations, but also due to a reduction in the number of arithmetic operations.</p>
J. G. Rokne and C. Yao, "Hybrid Scan-Conversion of Circles," in IEEE Transactions on Visualization & Computer Graphics, vol. 1, no. , pp. 311-318, 1995.