Best approximate circles on integer grids
ACM Transactions on Graphics (TOG)
Computer graphics
Fundamentals of interactive computer graphics
Fundamentals of interactive computer graphics
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Using program transformations to derive line-drawing algorithms
ACM Transactions on Graphics (TOG)
Graphics in overlapping bitmap layers
ACM Transactions on Graphics (TOG)
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Hybrid Scan-Conversion of Circles
IEEE Transactions on Visualization and Computer Graphics
Speeding Up Bresenham's Algorithm
IEEE Computer Graphics and Applications
IEEE Computer Graphics and Applications
An Improved Parallel Circle-Drawing Algorithm
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
Technical section: Drawing lines by uniform packing
Computers and Graphics
Digital Circularity and Its Applications
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
An iris detection method based on structure information
IWBRS'05 Proceedings of the 2005 international conference on Advances in Biometric Person Authentication
Real Polygonal Covers of Digital Discs - Some Theories and Experiments
Fundamenta Informaticae
Parallel fixed point digital differential analyzer
EGGH'93 Proceedings of the Eighth Eurographics conference on Graphics Hardware
On covering a digital disc with concentric circles in Z2
Theoretical Computer Science
| Hi-index | 0.00 |
Parallel algorithm for line and circle drawing that are based on J.E. Bresenham's line and circle algorithms (see Commun. ACM, vol.20, no.2, p.100-6 (1977)) are presented. The new algorithms are applicable on raster scan CRTs, incremental pen plotters, and certain types of printers. The line algorithm approaches a perfect speedup of P as the line length approaches infinity, and the circle algorithm approaches a speedup greater than 0.9P as the circle radius approaches infinity. It is assumed that the algorithm are run in a multiple-instruction-multiple-data (MIMD) environment, that the raster memory is shared, and that the processors are dedicated and assigned to the task (of line or circle drawing).