Hybrid scan-conversion of circles

摘要

Conventional algorithms for scan-conversion of circles select onenpixel in each iteration. Run-length slice circle algorithms haventherefore been suggested. These algorithms determine a run of pixels inneach iteration. The speed of scan-conversion is therefore increased duento I/O. A hybrid approach to the scan-conversion of circles isnpresented. The new approach combines the advantages of the two methodsninto a hybrid algorithm. Speedup is achieved in the hybrid algorithm notnonly due to the reduction in the number of I/O operations, but also duento a reduction in the number of arithmetic operations