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

Determine the complexity, 1)    The set of the algorithms whose order is O ...

1)    The set of the algorithms whose order is O (1) would run in the identical time.  True/False 2)    Determine the complexity of the following program into big O notation:

Dqueue, how can i delete from deque while deletion is restricted from one e...

how can i delete from deque while deletion is restricted from one end

Collision resolution techniques, complete information about collision resol...

complete information about collision resolution techniques

Converting an infix expression into a postfix expression, Q. Illustrate the...

Q. Illustrate the steps for converting the infix expression into the postfix expression   for the given expression  (a + b)∗ (c + d)/(e + f ) ↑ g .

Define algorithm, What is an Algorithm? An algorithm is a sequence of u...

What is an Algorithm? An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for getting a needed output for any legitimate input in a finite amoun

Representation of records, Records are mapped onto a computer store by simp...

Records are mapped onto a computer store by simply juxtaposing their elements. The address of a component (field) r relative to the origin address of the record r is named the fiel

Algorithm to sort a given list by quick sort method, Q. Write down an algor...

Q. Write down an algorithm to sort a given list by making use of Quick sort method. Describe the behaviour of Quick sort when input given to us is already sorted.

Explain the prim''s minimum spanning tree algorithm, Question 1. Explai...

Question 1. Explain the different types of traversal on binary tree 2. Explain the Prim's minimum spanning tree algorithm 3. Differentiate fixed and variable storage allo

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