State z-buffer algorithm, Data Structure & Algorithms

Assignment Help:

Z-Buffer Algorithm

Also known as the Depth-Buffer algorithm, this image-space method simply selects for  display the polygon or portion of a polygon that is nearest to the viewer, by checking the z-value of every pixel. Let us consider the quadrilateral ABCD of Figure, with the triangle EFG in front of it, and rectangle : PQRS behind it.

1664_data structure.png

As shown in Figure, for any point H in the triangle, its projection H′ on the quadrilateral will be behind H, and ZH will be less than ZH′. Hence, the entire triangle EFG will be visible.

On the other hand, the rectangle PQRS is partially hidden by the quadrilateral, the portion PQUT being hidden and the portion TURS being visible. This will be mathematically known by the fact that for all points (x, y) within the region PQUT, the Z for the quadrilateral will be less than the Z for the rectangle, while for all points within the region TURS, there will be no common (x, y) between the quadrilateral and the rectangle, leaving only the rectangle portion to be visible. The rays for the determination of H ′, T, and U ′ from H, T, and U are shown in parallel projection in Figure(b). The z-buffer memory size by this method is only dependent on the viewport, and any number of polygons can be handled.

 

 


Related Discussions:- State z-buffer algorithm

Total impedent of the circuit, an electrical student designed a circuit in...

an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

State cmy model, CMY Model  The cyan, magenta, yellow (CMY) colour mode...

CMY Model  The cyan, magenta, yellow (CMY) colour model is a subtractive model based on the colour absorption properties of paints and inks. As such it has become the standard

The threaded binary tree, By changing the NULL lines in a binary tree to th...

By changing the NULL lines in a binary tree to the special links called threads, it is possible to execute traversal, insertion and deletion without using either a stack or recursi

Multiple Queues in a single dimension array, Implement multiple queues in a...

Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them.

Write a program to create a hashed file, Write a program to create a hashed...

Write a program to create a hashed file that stores the records currently in the file " data_2013 ". Records should use the same fixed-length schema given previously, and should ag

Linked lists, what are grounded header linked lists?

what are grounded header linked lists?

Insertion of a key into a b-tree, Example: Insertion of a key 33 into a B-...

Example: Insertion of a key 33 into a B-Tree (w/split) Step 1: Search first node for key closet to 33. Key 30 was determined. Step 2: Node pointed through key 30, is se

Naïve recursive algorithm for binomial coefficients, How many recursive cal...

How many recursive calls are called by the naïve recursive algorithm for binomial coefficients, C(10, 5) and C(21, 12) C(n,k){c(n-1,k)+c(n-1,k-1) if 1 1 if k = n or k = 0

Define threaded binary tree, Threaded Binary Tree:- By changing the NUL...

Threaded Binary Tree:- By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using

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