Z- buffer algorithm, Computer Graphics

Assignment Help:

Q. Describe the z- Buffer algorithm for hidden surface removal.

Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. The surface depth is measured from the view plane along the z- axis of a viewing system. When object description is converted to projection coordinates (x, y, z) each pixel position on the view plane is specified by x & y coordinate, and z value gives the depth information. Thus object depth can by comparing the z- values. The z- buffer algorithm is usually implemented in the normalized coordinates, so that z- values range from 0 at the back clipping plane to 1 at the front clipping plane. Z- Buffer Algorithm  1. Initialize the depth buffer and refresh buffer so that for all buffer position (x, y), depth (x, y) =0 refresh (x, y) = 1 background. 2. For each position on each polygon surface, compare depth values to previously started values in the depth buffer to determine visibility. (a) Calculate the depth z for each (x,y) position on the polygon. (b) If z> depth (x, y) then set depth (x, y) =z refresh (x, y) = Isuff (x, y) Where I background intensity and Isuff (x, y) is the projection intensity value for the surface at pixel position (x, y). After all surface have been processed, the depth buffer contains depth values for the visible surface and the refresh buffer contains the corresponding intensity values for those surface. In the figure, among three surface, surface S1 has the smallest depth at view position (x, y) and hence highest z value. So it is visible at that position. To calculate the z- value, the plane equation Ax + By + Cz + D = 0 is used where (x, y, z) is any point on the plane, and the coefficient A, B, C and D are contents describing the spatial properties of the plane.                                                     Only one subtraction is needed to calculate z (x + 1, y) given z (x, y), since the quotient A/C is constant and ^x = 1. A similar incremental calculation cam be performed to determine the first value of z on the next scan line, decrementing by B/C for each ^y. Drawback of z- buffer (i) It requires an additional buffer and hence the large memory. (ii) It is a time consuming process as it requires comparison for each pixel instead for the entire polygon. 

 

 


Related Discussions:- Z- buffer algorithm

Data set, In this project, the image data set consists of 320 training imag...

In this project, the image data set consists of 320 training images and 285 test images. Table 1 shows the image data set in details. In addition to the original images, th

Anti aliasing - modeling and rendering, Anti Aliasing - Modeling and Render...

Anti Aliasing - Modeling and Rendering It is a method for enhancing the realism of an image through eliminating the jagged edges from it. Such jagged edges or "jaggies", appe

Why are the bitmap images unsuitable, Question: (a) (i) Give four re...

Question: (a) (i) Give four reasons to explain why are the bitmap images unsuitable for use in a high end print production workflow. (ii) An eps file has two main parts,

2d clipping algorithms - clipping and 3d primitives, 2D Clipping Algorithms...

2D Clipping Algorithms Clipping is an operation that eliminates invisible objects from the view window.  To understand clipping, recall that when we take a snapshot of a scene,

Geometric continuity - clipping and 3d primitives, Geometric Continuity ...

Geometric Continuity There is another notion of continuity called geometric continuity. Although the idea existed in differential geometry, the concept was introduced for geome

Determine the transformation matrix for cavalier projection, Determine the ...

Determine the transformation matrix for: a) Cavalier projection with θ=45 0 , and b) Cabinet projection with θ=30 0    c) Draw the projection of unit cube for all transfor

Define picture composition, QUESTION 1 Assume you work as Producer for...

QUESTION 1 Assume you work as Producer for the national TV channel in Mauritius. As such, you have been requested by the Director of Production to submit a proposal in the for

Implement the scan line polygon fill algorithm, Implement the Scan line pol...

Implement the Scan line polygon fill algorithm for any arbitrary polygon in C-language and then use your code to fill each of the following type of polygon. i)  Convex polygon

Points and lines - graphic primitives, Points and Lines - Graphic primitive...

Points and Lines - Graphic primitives In the previous section, we have seen to draw primitive objects; one has to firstly scan convert the objects. This concern to the operat

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