Issue No. 05 - September/October (1990 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.59037
<p>The fact that conventional line-drawing algorithms, when applied directly on parallel machines, can lead to very inefficient codes is addressed. It is suggested that instead of modifying an existing algorithm for a parallel machine, a more efficient implementation can be produced by going back to the invariants in the definition. Popular line-drawing algorithms are compared with two alternatives; distance to a line (a point is on the line if sufficiently close to it) and intersection with a line (a point on the line if an intersection point). For massively parallel single-instruction-multiple-data (SIMD) machines (with thousands of processors and up), the alternatives provide viable line-drawing algorithms. Because of the pixel-per-processor mapping, their performance is independent of the line length orientation.</p>
A. T. Pang, "Rendering: Line-Drawing Algorithms for Parallel Machines," in IEEE Computer Graphics and Applications, vol. 10, no. , pp. 54-59, 1990.