Fundamentals of interactive computer graphics
Fundamentals of interactive computer graphics
The Texas Instruments 34010 Graphics System Processor
IEEE Computer Graphics and Applications
An efficient structural technique for encoding `best-fit' straight lines
The Computer Journal
Double-step incremental generation of lines and circles
Computer Vision, Graphics, and Image Processing
Using program transformations to derive line-drawing algorithms
ACM Transactions on Graphics (TOG)
Double-Step Generation of Ellipses
IEEE Computer Graphics and Applications
On Properties of Discretized Convex Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Generating smooth 2-D monocolor line drawings on video displays
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Real-time raster scan unit with improved picture quality
ACM SIGGRAPH Computer Graphics
An efficient antialiasing technique
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Double-step incremental linear interpolation
ACM Transactions on Graphics (TOG)
Complex Gaussian integers for “Gaussian graphics”
ACM SIGPLAN Notices
Double- and triple-step incremental generation of lines
CSC '93 Proceedings of the 1993 ACM conference on Computer science
N-Step Incremental Straight-Line Algorithms
IEEE Computer Graphics and Applications
Hybrid Scan-Conversion of Circles
IEEE Transactions on Visualization and Computer Graphics
IEEE Computer Graphics and Applications
Auto-Adaptive Step Straight-Line Algorithm
IEEE Computer Graphics and Applications
The Analysis and Statistics of Line Distribution
IEEE Computer Graphics and Applications
A fast and simple all-integer parametric line
Graphics programming methods
Directly rasterizing straight line by calculating the intersection point
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
An alternate line drawing algorithm on hexagonal grid
Proceedings of the 6th ACM India Computing Convention
| Hi-index | 0.00 |
A major bottleneck in many graphics displays is the time required to scan-convert straight line segments. Most manufacturers use hardware based on Bresenham's [5] line algorithm. In this paper an algorithm is developed based on the original Bresenham scan-conversion together with the symmetry first noted by Gardner [18] and a recent double-step technique [31]. This results in a speed-up of scan-conversion by a factor of approximately 4 as compared to the original Bresenham algorithm. Hardware implementations are simple and efficient since the property of using only shift and increment operations is preserved.