|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Alex T. Pang, "Rendering: Line-Drawing Algorithms for Parallel Machines," IEEE Computer Graphics and Applications, vol. 10, no. 5, pp. 54-59, September/October, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/38.59037, author = {Alex T. Pang}, title = {Rendering: Line-Drawing Algorithms for Parallel Machines}, journal ={IEEE Computer Graphics and Applications}, volume = {10}, number = {5}, issn = {0272-1716}, year = {1990}, pages = {54-59}, doi = {http://doi.ieeecomputersociety.org/10.1109/38.59037}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Computer Graphics and Applications TI - Rendering: Line-Drawing Algorithms for Parallel Machines IS - 5 SN - 0272-1716 SP54 EP59 EPD - 54-59 A1 - Alex T. Pang, PY - 1990 VL - 10 JA - IEEE Computer Graphics and Applications ER - | |||
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.
1. P.M. Flanders et al., "Efficient High Speed Computing with the Distributed Array Processor,"Symp. High Speed Computer and Algorithm Organization, Academic, New York, 1977, pp. 113-128.
2. D. Hillis,The Connection Machine. Cambridge, MA: M.I.T. Press, 1985.
3. L.W. Tucker and G.G. Robertson, "Architecture and Applications of the Connection Machine,"IEEE Computer, Vol. 21, No. 8, Aug. 1988, pp. 26-38.
4. B. Kogan, W.J. Karplus, and A. Pang, "Simulation of Nonlinear Distributed Parameter Systems on the Connection Machine," Tech. Report TR-890026, Computer Science Dept., Univ. of California at Los Angeles, June 1989.
5. M. Potmesil and E. Hoffert, "The Pixel Machine: A Parallel Image Computer,"Computer Graphics(Proc. Siggraph), Vol. 23, No. 3, 1989, pp. 69-78.
6. W.M. Newman and R.F. Sproull,Principles of Interactive Computer Graphics, 2nd Ed., McGraw Hill, Amsterdam, 1979.
7. A. Bowyer and J. Woodwark,A Programmer's Geometry, Butterworths, London, 1985.