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

Explain principle of optimality, Explain principle of Optimality It ind...

Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of  optimal solutions to its subinstances.

Breadth first search, While BFS is applied, the vertices of the graph are d...

While BFS is applied, the vertices of the graph are divided into two categories. The vertices, that are visited as part of the search & those vertices that are not visited as part

Example of single node with multiple elements, The class Element represents...

The class Element represents a single node that can be part of multiple elements on a hotplate and runs in its own thread. The constructor accepts the initial temperature and a hea

Complexity of an algorithm, An algorithm is a sequence of steps to solve a ...

An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons

Several operations on a aa-tree, The following are several operations on a ...

The following are several operations on a AA-tree: 1. Searching: Searching is done using an algorithm which is similar to the search algorithm of a binary search tree. 2. Ins

What is a binary search tree (bst), What is a Binary Search Tree (BST)? ...

What is a Binary Search Tree (BST)? A binary search tree B is a binary tree every node of which satisfies the three conditions: 1.  The value of the left-subtree of 'x' is le

Describe commonly used asymptotic notations, Q.1 Compare two functions n 2 ...

Q.1 Compare two functions n 2 and 2 n for various values of n. Determine when second becomes larger than first. Q.2 Why do we use asymptotic notation in the study of algorit

Conversion of forest into tree, Conversion of Forest into Tree A binary...

Conversion of Forest into Tree A binary tree may be used to show an entire forest, since the next pointer in the root of a tree can be used to point to the next tree of the for

Delete a given node from a doubly linked list, Algorithm to Delete a given ...

Algorithm to Delete a given node from a doubly linked list Delete a Node from Double Linked List DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FOR

Insertion of element into a linked list, ALGORITHM (Insertion of element in...

ALGORITHM (Insertion of element into a linked list) Step 1 Begin the program Step 2 if the list is empty or any new element comes before the start (head) element, then add t

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