Parallel algorithms for generating the raster representation of straight lines and circles

https://doi.org/10.1016/0743-7315(91)90123-QGet rights and content

Abstract

This paper presents two parallel algorithms for generating graphics primitives on a raster scan display device. The first algorithm is for drawing straight lines and the second is for drawing circles. The line algorithm requires three integer multiplies and one or two integer divides in its setup and has the same loop as the sequential algorithm, but requires only about 1/P as many iterations of the loop, where P is the number of processors. Its setup is the equivalent of about seven loop iterations. The circle algorithm requires only four integer multiplies in its setup and approaches a speedup of 90% P. Its setup is the equivalent of about one loop iteration.

References (11)

  • A. Osterhaug
  • J.E. Bresenham

    Algorithm for computer control of a digital plotter

    IBM Systems J.

    (1965)
  • J.E. Bresenham

    A linear algorithm for incremental digital display of circular arcs

    Comm. ACM

    (Feb. 1977)
  • J.D. Foley et al.

    Fundamentals of Interactive Computer Graphics

    J.D. Foley et al.

    Fundamentals of Interactive Computer Graphics

  • S. Harrington

    Computer Graphics, A Programming Approach

There are more references available in the full text version of this article.

Cited by (2)

  • Image analysis and computer vision: 1991

    1992, CVGIP: Image Understanding
  • The mesh with hybrid buses: An efficient parallel architecture for digital geometry

    1999, IEEE Transactions on Parallel and Distributed Systems
View full text