Z- buffer algorithm, Computer Graphics

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. 

 

 

Posted Date: 7/12/2012 6:43:15 AM | Location : United States







Related Discussions:- Z- buffer algorithm, Assignment Help, Ask Question on Z- buffer algorithm, Get Answer, Expert's Help, Z- buffer algorithm Discussions

Write discussion on Z- buffer algorithm
Your posts are moderated
Related Questions
Time Based and Presentation Tools In such authoring systems, components and events are organized beside a timeline, along with resolutions as high as 1/30 second. Time based to

structure of display file

General Perspective transformation with COP at the origin Here we suppose the given point P(x,y,z) be projected like P'(x',y',z') on the plane of projection. The center of pro

Question 1: (a) What do you meant by the term typography and what is its main purpose? (b) Differentiate between typeface and font using examples. (c) Design knows many diffe

What are the advantages of rendering polygons by scan line method?  i. The max and min values of the scan were simply found.  ii. The intersection of scan lines with edges i

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

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,

Define Computer graphics.  Computer graphics remains one of the most popular and rapidly growing computer fields. Computer graphics may be explained as a pictorial representati

how can I draw a flower.

Define the term -Monitoring Chemical and nuclear plants (monitoring key parameters), hospitals (monitoring patient's vital signs), burglar alarms (monitoring for intruders) etc