Best approximate circles on integer grids
ACM Transactions on Graphics (TOG)
Fundamentals of interactive computer graphics
Fundamentals of interactive computer graphics
Double-step incremental generation of lines and circles
Computer Vision, Graphics, and Image Processing
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
ACM Transactions on Graphics (TOG)
Curve-drawing algorithms for Raster displays
ACM Transactions on Graphics (TOG)
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Rendering: Parallelization of Bresenham's Line and Circle Algorithms
IEEE Computer Graphics and Applications
Number-theoretic interpretation and construction of a digital circle
Discrete Applied Mathematics
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Fundamenta Informaticae
Digital Circularity and Its Applications
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Fundamenta Informaticae
On covering a digital disc with concentric circles in Z2
Theoretical Computer Science
| Hi-index | 0.00 |
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.