Illustrate the back face detection method, Data Structure & Algorithms

Assignment Help:

Illustrate the Back Face Detection Method

A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space method to determine which faces are the  visible front faces, and which are the hidden back faces.

The faces are characterized by their outward normals, and for this reason, the method is  also known as the Outward Normal Method.  The outward normal for every face of the convex solid is determined by taking the  cross-product of any two adjacent sides of the face. For consistency in checking, when  the viewer looks directly at the face under consideration, the vertex numbering (naming)  scheme for all faces must be in the same direction, say counter-clockwise. We need to start with a single polygon numbered in the proper order. There are analytical methods for doing this, but where user has control over the input, it is much easier to number the first polygon counter-clockwise when visible to the viewer.

Once this is done, any adjacent polygon will have the common edge traversed in the opposite direction, and hence no further decision-making will be necessary regarding the direction of numbering. This logic is particularly helpful in naming the faces away from the observer and those that are approximately horizontal, eliminating the need for the observer to imagine himself at all sorts of odd viewing angles.

 


Related Discussions:- Illustrate the back face detection method

Methods, what is folding method?

what is folding method?

Differentiate between nonpersistent and 1-persistent, Differentiate between...

Differentiate between Nonpersistent and 1-persistent Nonpersistent: If the medium is idle, transmit; if the medium is busy, wait an amount of time drawn from a probability dist

#title.state charts., explain two strategies to implement state charts with...

explain two strategies to implement state charts with the help of an example of each.

Breadth-first search, Breadth-first search starts at a given vertex h, whic...

Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

Sparse matrices, SPARSE MATRICES Matrices along with good number of zer...

SPARSE MATRICES Matrices along with good number of zero entries are called sparse matrices. Refer the following matrices of Figure (a)

What is an algorithm, What is an algorithm?  What are the characteristics o...

What is an algorithm?  What are the characteristics of a good algorithm? An algorithm is "a step-by-step process for accomplishing some task'' An algorithm can be given in many

Pseudocode algorithm to print the numbers from 1 to 10, 1. Write a pseudoco...

1. Write a pseudocode algorithm to print the numbers from 1 to 10, and then from 10 to 1, using exactly one loop. 2. The function contains() takes a food as an argument and tell

What is a spanning tree of a graph, What is a Spanning tree of a graph? ...

What is a Spanning tree of a graph? A Spanning Tree is any tree having of vertices of graph tree and some edges of graph is known as a spanning tree.

What are stored and derived attributes, What are stored and derived attribu...

What are stored and derived attributes?  Stored attributes: The attributes kept in a data base are called stored attributes.  Derived attributes: The attributes that are

Determine about the logic gates, Determine about the logic gates Many e...

Determine about the logic gates Many electronic circuits operate using binary logic gates. Logic gates essentially process signals that represent true or false or equivalent i.

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