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

Enumerate the use of data goggles- virtual reality, Enumerate the use of Da...

Enumerate the use of Data goggles- Virtual Reality Data goggles/helmets - These use optical systems and display screens which send 3D images to the eyes. Motion sensors mea

Computations with phong shading, Computations with Phong Shading Compu...

Computations with Phong Shading Computations involved along with Phong Shading:  i)   Find out average unit normal vector at each polygon vertex. ii)   Linearly interpol

Compression methods utilized for digital video, Compression methods utilize...

Compression methods utilized for digital video can be categorized in three major groups: General reason compression techniques can be utilized for any type of data. Intr

Which main components are needed for computer graphics, Can you tell which ...

Can you tell which main components (hardware and software) are needed for computer graphics? Besides the computer, some special devices and software may be needed especially fo

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Define coherence properties, Define coherence properties?  A coherence ...

Define coherence properties?  A coherence property of a scene is a part of a scene by which relate single part of the scene with the other parts of the scene.

Introduction, how can we write the introduction matter for graphicaluser in...

how can we write the introduction matter for graphicaluser interface

Transformation, Define transformation. Explain all basic transformation

Define transformation. Explain all basic transformation

Implement cohen sutherland and liang barsky algorithm, Implement Cohen Suth...

Implement Cohen Sutherland and Liang Barsky line clipping algorithms in C-language.  Test your code for line segments with end points falling in various regions.

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