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
A characterization of ten rasterization techniques
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
ACM Transactions on Graphics (TOG)
N-Step Incremental Straight-Line Algorithms
IEEE Computer Graphics and Applications
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
Jagged edges: when is filtering needed?
ACM Transactions on Graphics (TOG)
Speeding Up Bresenham's Algorithm
IEEE Computer Graphics and Applications
Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs
IEEE Computer Graphics and Applications
New Graphics Pipeline Approach Speeds Up Atomic Primitives Rendering
Computing in Science and Engineering
Directly rasterizing straight line by calculating the intersection point
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Image-based fast small triangle rasterization
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
| Hi-index | 0.00 |
The authors present the statistical distributions of line lengths and directions (slopes) in general graphics applications. They show practical facts of line characterization to guide graphics adapter hardware/software design decisions and provide realistic algorithm analysis assumptions. Their results are from analyzing randomly collected 1,012 graphics application programs written in OpenGL. Results are based on conventional CRT display frame buffer scan-conversion.