An efficient line drawing algorithm for parallel machines
Fractals have recently been used to draw self-similar objects such as trees, coastlines, and mountains in computer graphics. This paper shows that there are advantages in using fractals to draw lines in an MIMD environment as well. In the course of developing our parallel algorithm, methods which reduce the space requirements and increase the speed of the sequential algorithm upon which it is based are also discussed. While the only algorithm presented here deals with lines, it is possible that there are advantages in developing comparable algorithms which draw other self-similar geometric shapes, such as circles.
Keywords and PhrasesFractal algorithm line drawing MIMD environment integer logic rubber band lines binary tree
Unable to display preview. Download preview PDF.
- 1.J.E. Bresenham: Algorithm for computer control of a digital plotter. IBM Systems Journal 4(1), 25–30 (1965).Google Scholar
- 2.J.E. Bresenham: Incremental line compaction. Comp. J. 23(1), 46–52 (1980).Google Scholar
- 3.J.E. Bresenham: Run length slice algorithm for incremental lines. In: R.A. Earnshaw (ed.): Fundamental Algorithms for Computer Graphics. NATO ASI Series. New York: Springer-Verlag 1985, pp. 59–104.Google Scholar
- 4.X. Wu and J.G. Rokne: Double-step incremental generation of lines and circles. Comp. Vision Graphics Image Processing 37, 331–334 (1987).Google Scholar
- 5.G. Casiola: Basic concepts to accelerate line algorithms. Comput. & Graphics 12(3/4), 489–502 (1988).Google Scholar
- 6.W.E. Wright: Parallelization of Bresenham's line and circle algorithms. IEEE Computer Graphics & Applications 10(5), 60–67 (1990).Google Scholar
- 7.J.R. Rankin: Recursive bisection line algorithm. Computers & Graphics 15(1), 1–8 (1991).Google Scholar
- 8.A.V. Aho, J.E. Hopcroft, and J.D. Ullman: The Design and Analysis of Computer Algorithms. Reading, Mass. (USA): Addison-Wesley 1974, pp. 272–273.Google Scholar