Skip to main content
SpringerLink
Log in

An efficient line drawing algorithm for parallel machines

  • Communications
  • Conference paper
  • First Online:
Parallel Image Analysis (ICPIA 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 654))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Louisiana State University, 70803, Baton Rouge, LA

    Phil Graham, S. Sitharama Iyengar & Si-Qing Zheng

Authors
  1. Phil Graham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Sitharama Iyengar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Si-Qing Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Akira Nakamura Maurice Nivat Ahmed Saoudi Patrick S. P. Wang Katsushi Inoue

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Graham, P., Iyengar, S.S., Zheng, SQ. (1992). An efficient line drawing algorithm for parallel machines. In: Nakamura, A., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds) Parallel Image Analysis. ICPIA 1992. Lecture Notes in Computer Science, vol 654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56346-6_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-56346-6_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56346-4

  • Online ISBN: 978-3-540-47538-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation