Issue No. 05 - September/October (1990 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.59038
<p> 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).</p>
W. E. Wright, "Rendering: Parallelization of Bresenham's Line and Circle Algorithms," in IEEE Computer Graphics and Applications, vol. 10, no. , pp. 60-67, 1990.