第四章01--计算机图形学.pptVIP

The algorithm works fine unless some of the succeeding curves dip below the first curve. These curves are normally visible as the bottom of the surface; However, this algorithm treats them as invisible. The lower side of the surface is made visible by modifying the algorithm to accommodate a lower horizon that floats down as the algorithm progresses. This is implemented by using a second array, of size equal to the resolution of the image space in the x direction, containing the smallest value of y at each x location. Curve in constant z-coordinate cutting planes Do you understand “why floating horizon”? Use 2 1D arrays YMIN and YMAX (with 1 entry for each x). When drawing a polyline of constant z, for each x-value, test if above/below YMAX/YMIN (at x location) and update arrays. One way to identify the visible curve sections on the surface is to maintain a list of ymin and ymax values previously calculated for the pixel x coordinates on the screen. As we step from one pixel x position to the next, we calculated y value against the stored range y bounds for that pixel, the plot is visible. We then plot the point and reset the bounds for that pixel. Hence the algorithm is now, If at any given value of x the y value of the curve in the current plane is larger than the maximum y value or smaller than minimum y value for any previous curve at the x value, then the curve is visible. Otherwise it is hidden. Applied in image space (image precision). Limited to explicit functions only. Exploiting edge coherence. Applicable for free-form surfaces. Floating Horizon Characteristics: Problem: Partial line visibility Compute the intersection point The end HL / HS Algorithms Hybrid Object Space Image Space Hidden Line Hidden Surface Image-precision algorithms: determine what is visible at each pixel. Object-precision algorithms: determine which parts of each object are visible. Object space algorithms are implemented in the physical coordinate system in which the obje