Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
The connection machine
The pixel machine: a parallel image computer
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
A Programmer's Geometry
Technical section: Drawing lines by uniform packing
Computers and Graphics
Parallel fixed point digital differential analyzer
EGGH'93 Proceedings of the Eighth Eurographics conference on Graphics Hardware
| Hi-index | 0.00 |
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.