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

Polygon clipping - raster graphics and clipping, Polygon Clipping - Raster ...

Polygon Clipping - Raster Graphics and Clipping After considerate the idea of line clipping and its algorithms, we can currently extend the idea of line clipping to polygon cl

Arguments made in favour of analog sound, Arguments made in favour of Analo...

Arguments made in favour of Analog Sound Shape of the waveforms: from digital signals sound reconstructed which is claimed to be harsher and unnatural compared to analog si

Midpoint circle algorithm for scan converting a circle, Explain Bresenham s...

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle

Normalization transformation, what is normalization transformation?why is i...

what is normalization transformation?why is it needed and important?give simple example also.

What is meant by addressability, What is meant by Addressability? Ans. ...

What is meant by Addressability? Ans. Addressability is the number of individual dots per inch (d.p.i.) that can be formed. If the address of the current dot is (x, y) then the

Vecgen, explain vecgen algoritham

explain vecgen algoritham

Bezier curve, Q. What is a Bezier Curve? What are blending function? Write ...

Q. What is a Bezier Curve? What are blending function? Write an algorithm for generating Bezier Curves. A curve which has the following properties is called Bezier Curve: 1. A

Differentiate between lossy and lossless compression, Question: (a) Di...

Question: (a) Differentiate between lossy and lossless compression. (b) State the uses of the two compression standards MPEG-1 and MPEG-2. (c) State three areas where

Positioning Techniques, Explain Positioning Techniques in computer Graphics...

Explain Positioning Techniques in computer Graphics in detail

Ambient reflection-polygon rendering & ray tracing methods , Ambient Reflec...

Ambient Reflection-Polygon Rendering & Ray Tracing Methods When we go for the examiner of light effects, so surroundings play a significant role and it is assumed as there

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