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

Queue, algorithm for insertion in a queue using pointers

algorithm for insertion in a queue using pointers

Simplifying assumptions of wire frame representation, Simplifying Assumptio...

Simplifying Assumptions of wire frame representation Neglect colour - consider Intensity: For now we shall forget about colour and restrict our discussion just to the intensi

Hash clash, Q. What do you understand by the term by hash clash? Explain in...

Q. What do you understand by the term by hash clash? Explain in detail any one method to resolve the hash collisions.

Non Recursive Algorithm to Traverse a Binary Tree, Q. Write down a non recu...

Q. Write down a non recursive algorithm to traverse a binary tree in order.                    Ans: N on - recursive algorithm to traverse a binary tree in inorder is as

Hash tables, Q. Explain the Hash Tables, Hash function and Hashing Techniqu...

Q. Explain the Hash Tables, Hash function and Hashing Techniques properly?             A n s . H as h Table is explained as follows : A hash table is a data struc

Dijkstra's algorithm, Q. Explain Dijkstra's algorithm for finding the short...

Q. Explain Dijkstra's algorithm for finding the shortest path in the graph given to us.  Ans: The Dijkstra's algorithm: This is a problem which is concerned with finding

Stack and queue, write a algorithsm in c to perform push and pop operation...

write a algorithsm in c to perform push and pop operations stastic implementation using array ?

Sorting, explain quick sort algorithm

explain quick sort algorithm

Algorithm for multiplication of two sparse matrices using li, algorithm for...

algorithm for multiplication of two sparse matrices using linked lists..

Complexity of algorithm, The simplest implementation of the Dijkstra's algo...

The simplest implementation of the Dijkstra's algorithm stores vertices of set Q into an ordinary linked list or array, and operation Extract-Min(Q) is just a linear search through

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