Scan-line method, Computer Graphics

Assignment Help:

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

 

 


Related Discussions:- Scan-line method

Studio-based one-plus-one interview, Question 1: a. List respectively ...

Question 1: a. List respectively ten main technical and human components necessary to ensure a studio-based one-plus-one interview? b. How does each component contribute in

Xy-shear about the origin - 2-d and 3-d transformations, xy-Shear about the...

xy-Shear about the Origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') as a outcome of shear transformation in both x- and y-directions a

Write a simple c-code to generate a circular arc, Write a simple C-code to ...

Write a simple C-code to generate a circular arc between two angle values. Use this to draw Figure.

Proof of subsequent properties of bezier curves, Proof of subsequent proper...

Proof of subsequent properties of Bezier curves Note: Proof of subsequent properties of Bezier curves is left as a work out for the students P' (0) = n (p 1 - p 0 ) P

High level techniques (motion generalized), High level techniques (motion g...

High level techniques (motion generalized) Techniques utilized to explain general motion behavior of any of graphic object, such techniques are algorithms or models utilized to

Dda or digital differential analyzer algorithm, DDA or Digital Differential...

DDA or Digital Differential Analyzer Algorithm - Line generation algorithms From the above discussion we get that a Line drawing is accomplished through calculating intermedi

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

Image editing tools in multimedia, Image Editing Tools These are specia...

Image Editing Tools These are specializing and influential tools for enhancing and re-touching existing bit-mapped images. Such applications also give several of the features a

How many times will vertex appear in the intersection points, 1. For the po...

1. For the polygon shown in Figure on the next page, how many times will the vertex V 1 appear in the set of intersection points for the scan line passing through that point?  How

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