ScanConvertingLines.pptVIP

同济大学　海洋与地球科学学院 1999年7月 Scan Converting Lines ? A scan-conversion algorithm for lines computes the coordinates of the pixel that lie on or near an ideal, infinitely thin straight line imposed on a 2D raster grid. As principle, we would like the sequence of pixels to lie as close to the ideal line as possible and to be as straight as possible. Consider a 1-pixel –thick approximation to an ideal line;what properties should it have? for lines with slopes between –1 and 1 inclusive, exactly 1 pixel should illuminated in each column; for line with slopes outsides this range,exactly 1 pixel should be illuminated in each raw. 1 The Basic Incremental Algorithm Case 1: max(|△x|,|△y|)=|△x|，that is, |m|≤1 2 Midpoint line algorithm Programmer steps: 1. Input the two endpoints P0(x0,y0) and P1(x1,y1). 2. Calculating the initial value of the dx and dy, and the initial decision variable d0=0.5-m,x=x0, y=y0. 3. Plot point (x,y). Confirm the sign of d. if d0, then update (x,y)= (x+1,y+1), and update d=d+1-k; if d=0, then update (x,y)=(x=1,y), d=d-m. 4. If the xx1, then goto 3 until x=x1 * * All lines should be drawn with constant brightness , independent of length and orientation, an as rapidly as possible. There should also be provisions for drawing lines that are more than 1 pixel wide. Centered on the ideal line, that are affected by line style and pen-style attributes, and that create other effects needed for high-quality illustrations. For example, the shape of the end-point regions should be under programmer control to allow beveled, rounded, and mitered corners. We would even like to be able to minimize the jaggies due to the discrete approximation of the ideal line by using antialiasing techniques exploiting the ability to set the intensity of individual pixels on n-bits-per-pixel displays. Figure 1.1 shows a highly magnified view of a 1-pixel-thick line and of an ideal line that it approximates.