Buffer areas required for z-buffer algorithm, Computer Graphics

Assignment Help:

Buffer Areas Required For Z-Buffer Algorithm

For applying z-buffer algorithm, we need two buffer areas or two 2-Dimentional arrays:

1) Depth-buffer [i,j], to save the depth-value of the visible surface for all pixel in the view plane, and

2) Refresh-buffer [i,j], to save the pixel intensities of the visible surfaces.

A. In contrast to z/depth-buffer method, Scan-line method deals along with numerous surfaces. Since it processes each scan-line at one time, all polygons intersected through such scan-line are examined to find out that surfaces are visible. The visibility test engages the comparison of depths of each overlapping surfaces to find out one is nearer to the view plane. If it is determines so, then it is declared like a visible surface and the intensity values at the positions beside the scan-line are entered in the refresh-buffer.

B. Area-subdivision method is fundamentally an image-space method but utilizes object- space computations for reordering of surfaces as per to depth. The method makes utilization of area coherence in a scene by collecting those areas which form part of a particular surface. In this method, we successively subdivide the whole viewing area in small rectangles till each small area is the projection of part of a particular visible surface or no surface in any way.


Related Discussions:- Buffer areas required for z-buffer algorithm

Shannon fano with the lempel ziv welsh algorithm, Question: (a) A stat...

Question: (a) A statistical encoding algorithm is being considered for the transmission of a large number of long text files over a public network. Part of the file content i

Transformation for 3-d rotation, Transformation for 3-D Rotation Rotat...

Transformation for 3-D Rotation Rotation in 3-dimensions is considerably more complicated then rotation in 2-dimensions. In 2-Dimentional, a rotation is prescribed via an angl

Example of bezier curves - modeling and rendering, To prove: P (u = 0) = p0...

To prove: P (u = 0) = p0 Solution : = p 0 B n,0 (u) + p 1 B n, 1 (u) +...... + p n B n, n (u)...............(1)  B n,i (u) = n c i u i (1 - u) n-i B n,0

What do you mean by perspective projection, What do you mean by Perspective...

What do you mean by Perspective projection?  Perspective projection is one in which the lines of projection are not parallel. Instead, they all converge at a single point known

Ray tracing - polygon rendering & ray tracing methods, Ray Tracing - Polygo...

Ray Tracing - Polygon Rendering & Ray Tracing Methods Ray tracing obeys all rays from the eye of the viewer back to the light sources. The method Ray tracing is very good at

What are the advantages of electrostatic plotters, What are the advantages ...

What are the advantages of electrostatic plotters?  They are faster than pen plotters and very high quality printers. Recent electrostatic plotters contain a scan-conv

Functioning of input devices - 2d shape primitives, Functioning of Input De...

Functioning of Input Devices Functioning of input devices-Keyboard, mouse, trackball and space ball, Joystick, data glove, digitizer, scanner, touch panel, light pen, voice sys

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

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