Algorithm scan-line, Computer Graphics

Assignment Help:

Algorithm (scan-line):

For each scan line perform from step (1) to (3).

1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background-color.

2) For each polygon means, get all pixels on the current scan-line as S1 that lies inside the polygon. For all of these x-values:

a) Compute the depth z of the polygon at (x,y)

b) If z < depth [x], set depth [x] =z and intensity consequent to the polygon's shading.

3) When all polygons have been identified; the values comprised in the intensity array present the solution and can be a duplicate in the frame-buffer.

 


Related Discussions:- Algorithm scan-line

Introduction of viewing transformations, Introduction of Viewing  Transfor...

Introduction of Viewing  Transformations Projection is fundamentally a transformation or mapping of 3D objects upon 2D screen. Projection is mostly categorised in Para

List out the various text clipping, List out the various Text clipping?  ...

List out the various Text clipping?  All-or-none string clipping -if all of the string is inside a clip window, keep it or else discards. All-or-none character clipping - disca

What are the different ways of specifying spline curve, What are the differ...

What are the different ways of specifying spline curve?  Using a set of boundary conditions that are imposed on the spline. Using the state matrix that characteristics

#title., what is the working procedure of CRT with diagram

what is the working procedure of CRT with diagram

Arguments made in favour of analog sound, Arguments made in favour of Analo...

Arguments made in favour of Analog Sound Shape of the waveforms: from digital signals sound reconstructed which is claimed to be harsher and unnatural compared to analog si

Hypertext, Hypertext: it is conceptually very similar as regular text: it ...

Hypertext: it is conceptually very similar as regular text: it can be stored, searched, read, or edited along with a significant difference: hypertext is text along with pointers

Application of sutherland hodgman polygon clipping, For good understanding ...

For good understanding of the application of the rules specified above see the following figure, where the shaded region demonstrates the clipped polygon. Fi

Deffrent, deffrent between vecgen algorithm and bresenham line algorithm in...

deffrent between vecgen algorithm and bresenham line algorithm in computer graphic

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd