计算机图形学复习提纲资料.ppt

* F(x,y)=ax+by+c=0 F(x+1,y+0.5) =0 (x+1,y+1) 或(x+1,y) F(x+1,y+0.5) >0 中点在直线上方，选(x+1,y) F(x+1,y+0.5) <0 中点在直线下方，选(x+1,y+1) * F(x,y)=ax+by+c=0 F(x+1,y+0.5) =0 (x+1,y+1) 或(x+1,y) F(x+1,y+0.5) >0 中点在直线上方，选(x+1,y) F(x+1,y+0.5) <0 中点在直线下方，选(x+1,y+1) * * * * Def. A world-coordinate area selected for display is called a window. Def. An area on a display device to which a window is mapped is called a viewport. Def. In general, the mapping of a part of a world-coordinate scene to device coordinate is referred to as a viewing transformation * 6.2 2D Clipping Operations Definition of Clipping any procedure that identifies those portions of a picture that are either inside or outside of a specified region of space is referred to as a clipping. Clipping time window clipping viewport clipping * This is one of the oldest and most popular line-clipping procedures. Generally, the method speeds up the processing of line segments by performing initial tests that reduced the number of intersections that must be calculated. Lines are defined by their endpoints, so it should be possible just to examine these, and not every pixel on the line Most applications of clipping use a window that is either very large, I.e. nearly the whole scene fits inside, or very small, I.e. most of the scene lies inside the window Hence, most lines may be either trivially accepted or rejected * IDEA -- Faster line clipping algorithm, based on analysis of the parametric equation of a line segment Parametric Equation two endpoints (x1,y1), (x2,y2) x=x1+(x2-x1)u y=y1+(y2-y1)u, 0<=u<=1 * Algorithm Description Computing Pk, Qk, k=1~4 Judge if there any Pk= 0, then the line is parallel to one of the clipping boundaries. If, for that value of k, we also find Qk < 0, then the line is completely outside the boudary, otherwise the line is inside the boudary for case Pk<>0, calculate the value of u that corresponds to the intersection point as Qk/Pk For each line, calculate two parameters u1&u2 tha