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

Understanding the concept of hypertext and hypermedia, Understanding the Co...

Understanding the Concept of hypertext and hypermedia: For know the principle of Hypertext and Hypermedia we will look at how the human memory works.

Hypermedia, Hypermedia: it is a superset of hypertext. Hypermedia document...

Hypermedia: it is a superset of hypertext. Hypermedia documents comprise links not only to the other pieces of text, although also to other forms of media: sounds and images and m

Vertices of bezier curve find out 3 points on bezier curve, Specified p 0 ...

Specified p 0 (1, 1): p 1 (2, 3); p 2 (4, 3); p 3 (3, 1) as vertices of Bezier curve find out 3 points on Bezier curve? Solution : We consider Cubic Bezier curve as: P (

Important points about the curve segment, Important Points about the Curve ...

Important Points about the Curve segment - properties of bezier curves Note : if P (u) → = Bezier curve of sequence n and Q (u) → Bezier curve of sequence m. After that Co

Demerit - phong shading or normal vector interpolation shadi, Demerit - pho...

Demerit - phong shading or normal vector interpolation shading Needs lot of computations to determine intensity at a point, hence increases the cost of shading in any impleme

Tcp connection, what is the opengl code for tcp connection?

what is the opengl code for tcp connection?

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Differentiate between z-buffer method and scan-line method, Differentiate b...

Differentiate between z-buffer method and scan-line method. What is the visibility test made in these methods? Solution : In depth buffer algorithm every pixel location on the

List out the merits of plasma panel display, List out the merits of Plasma ...

List out the merits of Plasma panel display?  Merits  Refreshing is not needed Produce a very steady image free of Flicker Less bulky than a CRT. Demerits

Z-buffer, describe z-buffer algorithm removing hidden surface

describe z-buffer algorithm removing hidden surface

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