第5章二维变换和二维观察概论.ppt

* 通过改变视口的位置，我们可在输出设备上的不同显示区域观察物体。也可通过改变视口的大小来改变显示物体的尺寸和位置。如果将不同尺寸的窗口连续映射到尺寸不变的视口中，则可以得到缩放的效果。当窗口变小时，就可放大物体的显示，从而观察到当窗口较大时未能观察到的细节。通过将一个固定大小的窗口移动过一个场景中不同的对象或同一对象的不同位置，产生扫视的效果 * Some graphics packages that provide window and viewport operations allows only standard rectangles, but a more general approach is to allow the rectangular window to have any orientation. In this case we carry out the viewing transformation in several steps. 2D Viewing Pipeline 2D viewing-transformation pipeline Modeling coordinates -- World coordinates -- Viewing coordinates -- Normalized viewing coordinates -- Display coordinates * * 线段与窗口的位置关系： 整个线段全在窗口内 整个线段全在窗口外 线段部分在窗口外，部分在窗口内 * 线段与窗口的位置关系： 整个线段全在窗口内 整个线段全在窗口外 线段部分在窗口外，部分在窗口内 * CS coding The window edges are assumed to be extended so that the whole picture is divided into 9 regions Each region is assigned a four-bit code, called region code * The region code for each end of the line is computed, giving codes c1 and c2. One of the following cases will occur: Both c1 and c2 are 0000. This means that both endpoints lie inside the window, so the line may be trivially accepted If c1 and c2 have one or more bits in common, then the line must be wholly outside the window. Hence if c1 AND c2 is not equal to zero, the line may be trivially rejected If c1 AND c2 is equal to zero, further processing is necessary. Lines that cannot be identified as completely inside or outside a clip window are checked for intersection with the window boundary in the order left, right, bottom, top. The remaining part of the line is checked against the other boundaries until the line is totally discarded or a section is found inside the window * 该算法与Cohen-Sutherland 一样，用于标准矩形窗口的裁剪 边界与坐标轴平行 ，但它是更快的直线裁剪算法，它基于线段的参数化方程的分析， * * 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, ot