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

Types of polygon tables curves and surfaces, Types of Polygon tables curves...

Types of Polygon tables curves and surfaces Attribute tables: This table has object information as transparency, surface reflexivity, texture features of an object in the vi

Advantages of gif files, Advantages of GIF Files GIF is the most ex...

Advantages of GIF Files GIF is the most extensively supported graphics format upon the Web. GIFs of diagrammatic images appear better than JPEGs. GIF maintains inte

Dda or digital differential analyzer algorithm, DDA or Digital Differential...

DDA or Digital Differential Analyzer Algorithm - Line generation algorithms From the above discussion we get that a Line drawing is accomplished through calculating intermedi

B splines, What is uniform rational splines

What is uniform rational splines

Zero acceleration (constant speed), Zero Acceleration (Constant Speed ) ...

Zero Acceleration (Constant Speed ) Now, the time spacing for the in-betweens that is: in-between frames is at equal interval; which is if, we want N in-betweens for key frames

What is multimedia, Question 1 What is Multimedia? Explain sound multimedi...

Question 1 What is Multimedia? Explain sound multimedia element Question 2 Explain any three elements of drawings Question 3 Explain any three types of drawing Quest

Find the normalization transformation, Illustration: Find the normalizatio...

Illustration: Find the normalization transformation N that uses the rectangle W (1, 1), X (5, 3), Y (4, 5) and Z (0, 3) as a window and also the normalized device screen like the

#title., what is the working procedure of CRT with diagram

what is the working procedure of CRT with diagram

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