Directly rasterizing straight line by calculating the intersection point

Authors:
Hua Zhang;Changqian Zhu;Qiang Zhao;Hao Shen
Affiliations:
Department of Computer and Communication Engineering, Southwest Jiaotong University, Chengdu, Sichuan, P.R.China;Department of Computer and Communication Engineering, Southwest Jiaotong University, Chengdu, Sichuan, P.R.China;Institute of Computer Applications, China Academy of Physics Engineering, Mianyang, Sichuan, P.R.China;Institute of Computer Applications, China Academy of Physics Engineering, Mianyang, Sichuan, P.R.China
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Year:
2005

Citing 7
Cited 0

Double-step incremental generation of lines and circles

Computer Vision, Graphics, and Image Processing
Fast line scan-conversion

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
The Analysis and Statistics of Line Distribution

IEEE Computer Graphics and Applications
A High-Speed Algorithm for the Generation of Straight Lines and Circular Arcs

IEEE Transactions on Computers
Algorithm for computer control of a digital plotter

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a method of line scan-conversion is presented by calculating the intersection point of straight line with the middle scan line of screen. With this method, the pixel’s screen coordinate of spatial line could also be obtained. Moreover, raster precision is exactly the same as that of Bresenham’s middle algorithm; and more than or at least one pixel could be obtained at a computational effort of one inner loop. However, to Bresenham’s middle algorithm, only one pixel is obtained in one inner loop’s calculating.