Rendering: Parallelization of Bresenham's Line and Circle Algorithms
IEEE Computer Graphics and Applications
Journal of Graphics Tools
The Analysis and Statistics of Line Distribution
IEEE Computer Graphics and Applications
A fast and simple all-integer parametric line
Graphics programming methods
Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques
Parallel fixed point digital differential analyzer
EGGH'93 Proceedings of the Eighth Eurographics conference on Graphics Hardware
| Hi-index | 0.00 |
The line segment is the basic entity in virtually all computer graphics systems. J.E. Bresenham's algorithm (1965) efficiently scan converts line segments because it requires only an integer addition and a sign test for each pixel generated. It is the standard for scan converting a line segment. A version based on the properties of linear Diophantine equations that can speed scan conversion by a factor of almost five is presented. Two approaches are used to achieve speedup. One is to parallelize the line generation process. The other is to take advantage of the repeated patterns that the algorithm generates.