Scan-line method, Computer Graphics

In contrast to depth-buffer method, here we identify one surface at one time, scan-line method deals along with multiple surfaces. Since it processes each scan-line at one time, all polygons intersected from that scan-line are examined to find out that surfaces are visible. The visibility test includes the comparison of depths of all overlapping surfaces, to find out that one i.e. closer to the view plane. It is declared like a visible surface and the intensity values at the positions beside the scan- line are entered in the refresh-buffer, if it is determined.

Assumptions:

a)      Plane of projection is Z=0 plane.

b)      Orthographic parallel projection.

c)      Direction of projection as: d = (0,0, -1)

d)      Objects made up of polygon faces.                     

 Scan-line algorithm resolves the hidden-surface issue, one scan-line at one time, generally processing scan lines starting the bottom to the top of the display.

 The scan-line algorithm is a one-dimensional version of the Z-Buffer. We need two arrays, intensity [x] and depth [x] to hold values for a particular scan-line.

 

                                          1519_Scan-line method.png

This time at Q1and Q2 both polygons are active that called sharing

Compare the z-values at Q1 for both the planes (P1 and P2). Let z1(1),z1(2) be the z-value at Q1 ,consequent to P1and P2 polygon correspondingly.

As the same z2(1), z2(2) be the z-value at Q2, consequent to P1and P2 polygon correspondingly.

Case1: z1(1)< z1(2)                         

             z2(1) < z2(2)  

In this case Q1, Q2 is filled along with the color of P2.

Case2: z1(2) < z1(1)

             z2(2) < z2(1)  

In this case Q1, Q2 is filled along with the color of P2.

Case3: Intersection is taking place.

In this condition we have to return to pixel by pixel and find out which plane is closer. After that choose the color of pixel

 

 

Posted Date: 3/22/2013 8:44:18 AM | Location : United States







Related Discussions:- Scan-line method, Assignment Help, Ask Question on Scan-line method, Get Answer, Expert's Help, Scan-line method Discussions

Write discussion on Scan-line method
Your posts are moderated
Related Questions
Question 1: (a) Explain what are Final Gathering and Global Illumination and state why you would use those features when you render in MAYA. (b) List clearly the steps in

To reflect the ball off of the polyline, we need to re?ect it off of the segment that had the minimum thit. But the reflection computation depends only on t hit , n, P and v, so th


Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

An 8x8 image f[i,j] has gray levels given by the following equation: f [i , j]= ? i-j ? ; i,j=0,1,2,3,4,5,6,7. a. Calculate the gray level value for all the pixels in the 8x8

Adobe Premiere - Softwares for computer animation It just like the name as is generated by Adobe. This is a tool used to composite digitized video, stills and applies a variet

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith

3D Primitive and Composite Transformations Previously you have studied and implemented 2D geometric transformations for object definitions in two dimensions. These transformati

limitationsof dda