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

Define addressability, What is meant by Addressability?  The Addressabi...

What is meant by Addressability?  The 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

Panning and zooning, what is zooming and panning in computer graph please e...

what is zooming and panning in computer graph please explan??

Test for checking disjoint polygons by using of min-max test, Test For chec...

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

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

how can we write the introduction matter for graphicaluser interface

Visible-surface detection, Visible-Surface Detection For the generation...

Visible-Surface Detection For the generation of realistic graphics display you know that hidden surfaces and hidden lines should be identified for removing. For this reason we

Scientific visualization, Scientific Visualization This is complex for...

Scientific Visualization This is complex for the human brain to create sense out of the large volume of numbers produced through a scientific computation. Statistical and nume

Advantages of computer aided design, Advantages of Computer aided design  ...

Advantages of Computer aided design  -   It is simpler to modify drawings  -   A library of parts can be kept  -   Ability to do automatic costings -   Ability to mod

Briefly describe jackson''s theorem, Question 1 What is Packet-switching n...

Question 1 What is Packet-switching network? Discuss its basic operation Question 2 Briefly describe Jackson's theorem Question 3 List and explain the two popular

Compute the height of the resized image, Question) Compute the following: ...

Question) Compute the following:  a) Size of 420 × 300 image at 240 pixels per inch.  b) Resolution (per square inch) of  3 ×  2 inch image that has  768×512 pixels.  c) H

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