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
Determine the transformation matrix for the reflection, Computer Graphics

Macintosh - Hardware for computer animation It was originally designed to be graphic and desktop publishing machines. Macs did not turn into which widely known till recently, a

Question: (a) Sound often gives the only effective way to convey an idea, elicit an emotion, or dramatise a point. Explain two situations of the use of sound that would be con

Common Principles of Ray Tracing Based upon the nature or attributes of the surface given by the user, the subsequent effects are implemented, as per to rules of optics:  a

Sketch Line Segment That Joining By Using Bresenham Line Algorithm Example: Sketch line segment that joining (20, 10) and (25, 14) by using Bresenham line generation algorit

Question 1: (a) Briefly describe how Parenting could be used in Adobe After effects CS3. (b) Explain the term Vanishing Point and specify when it can be used. Propose how

describe z-buffer algorithm removing hidden surface

Properties of Perspective projections - Transformation 1) Faraway objects seem smaller. 2) Straight lines are projected to straight lines. 3) Let line 1 and 2 is two s

What is Polygon mesh?  Polygon mesh is a method to show the polygon, when the object surfaces are tiled, it is more convenient to state the surface facets with a mesh function.

what are the advertising effects of scan conversion