Using program transformations to derive line-drawing algorithms
TL;DR: The transformations are used to derive several highly parallel variants of Bresenham's algorithm, designed for use on displays that can generate more than one pixel at a time.
read more
Abstract: : A wide variety of line-drawing algorithms can be derived by applying program transformations to a simple, obviously correct algorithm. The transformations increase the algorithm's performance and eliminate the need for floating-point computations. Two familiar algorithms are derived in this way: Bresenham's algorithm and the digital differential analyzer (DDA). The transformations are then used to derive several highly parallel variants of Bresenham's algorithm, designed for use on displays that can generate more than one pixel at a time. The treatment shows a complete, extended example of the practical use of program transformations. Moreover, the transformations derive Bresenham's algorithm without recourse to complex geometric arguments.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
3D scan-conversion algorithms for voxel-based graphics
Arie E. Kaufman,Eyal Shimony +1 more
- 01 Jan 1987
TL;DR: In this paper, an assortment of algorithms, termed three-dimensional (3D) scan-conversion algorithms, is presented. And all algorithms are incremental and use only additions, subtractions, tests and simpler operations inside the inner algorithm loops.
187
Curve-drawing algorithms for Raster displays
Jerry R. Van Aken,Mark F. Novak +1 more
TL;DR: The midpoint method for deriving efficient scan-conversion algorithms to draw geometric curves on raster displays is compared with the two-point method used by Bresenham, and is seen to be more accurate in the general case, without increasing the amount of computation required.
104
A VLSI architecture for updating raster-scan displays
Satish Gupta,Robert F. Sproull,Ivan E. Sutherland +2 more
- 01 Aug 1981
TL;DR: This paper describes an on-going project at Carnegie-Mellon University in which a frame buffer raster-scan display system is designed which has the high performance typically required for interactive display applications.
101
A note on discrete representation of lines
TL;DR: Equivalence classes of identically drawn lines are described in terms of Farey series; this treatment notably simplifies previous work of Dorst and Smeulders.
76
Focus on Scientific Visualization
Hans Hagen,Heinrich Müller,Gregory M. Nielson +2 more
- 26 Aug 1991
TL;DR: volume Visualization in Medicine: Techniques and Applications and Conclusions.- References.
75
References
Algorithm for computer control of a digital plotter
TL;DR: An algorithm is given for computer control of a digital plotter that may be programmed without multiplication or division instructions and is efficient with respect to speed of execution and memory utilization.
2.5K
•Book
The Theory of Parsing, Translation, and Compiling
Alfred V. Aho,Jeffrey D. Ullman +1 more
- 01 Jan 1972
TL;DR: It is the hope that the algorithms and concepts presented in this book will survive the next generation of computers and programming languages, and that at least some of them will be applicable to fields other than compiler writing.
2K
Structured Programming with go to Statements
TL;DR: For serious students of structured programming, and also for language designers, Knuth's "Structured Programming with go to Statements" is probably the paper to read.
•Book
Structured programming with go to statements
Donald E. Knuth
- 01 Jan 1979
TL;DR: For instance, Knuth's "Structured Programming with Go-To Statements" as discussed by the authors is probably the most complete description of structured programming of all the selections in this book, and it can be used as a good starting point for a discussion of the role of gotos in structured programming.
631