Directly Rasterizing Straight Line by Calculating the Intersection Point

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.

[1]  Yasuhito Suenaga,et al.  A High-Speed Algorithm for the Generation of Straight Lines and Circular Arcs , 1979, IEEE Transactions on Computers.

[2]  Brian Wyvill,et al.  Fast line scan-conversion , 1990, TOGS.

[3]  Roger L.T. Cederberg.  A new method for vector generation , 1979 .

[4]  R. Brons,et al.  Linguistic Methods for the Description of a Straight Line on a Grid , 1974, Comput. Graph. Image Process..

[5]  Jim X. Chen,et al.  The Analysis and Statistics of Line Distribution , 2002, IEEE Computer Graphics and Applications.

[6]  Graeme W. Gill,et al.  N-step incremental straight-line algorithms , 1994, IEEE Computer Graphics and Applications.

[7]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[8]  Xiaolin Wu,et al.  Double-step incremental generation of lines and circles , 1987, Comput. Vis. Graph. Image Process..

[9]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[10]  Arnold W. M. Smeulders,et al.  Discrete Representation of Straight Lines , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Jane Veeder,et al.  The Paint Problem , 1985, IEEE Computer Graphics and Applications.