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.


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
Homogeneous Coordinate Systems - 2-d and 3-d transformations Suppose P(x,y) be any point in 2-D Euclidean (Cartesian) system. In HC System, we add a third coordinate to a poin

Question 1 Write a note on: Audio Spectrum & Audio Waveform Question 2 What is high dynamic range color? Explain gradient color Question 3 Describe Time-Remapping

Main objectives: To test to micro-controller I2C protocol bus functionality Setting and displaying accurate time and date on the LCD GENERAL DESCRIPTION The D

difference between gl,glu and glut

Principal vanishing point write respect to y-axis By the 2nd Row of the matrix as in Equation, the principal vanishing point w.r.t y-axis will as: (0, 5/√2, 0, 1/√2) in hom

State whether the following statements are true or false. Give reasons/examples to justify your answer.  a)  Cavalier projection is a parallel projection. b)  Angles are not

After going through this section, you should be capable to: know the meaning of Visible-surface detection; distinguish among image-space and object-space approach for vi

GIF File Compression The Graphic Interchange Format file format utilizes a relatively basic form of file compression which squeezes out inefficiencies within the data storage w