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

Degree of node, Q. The degree of a node is defined as the number of childre...

Q. The degree of a node is defined as the number of children it has. Shear show that in any binary tree, the total number of leaves is one more than the number of nodes of degree 2

Data manipulation, perform the following length operation LENGTH("welcome t...

perform the following length operation LENGTH("welcome to ICA")=

State the range of operation of abstract data type, State the range of oper...

State the range of operation of ADT Operations of the Range of T ADT includes following, where a, b ∈ T and r and s are values of Range of T: a...b-returns a range value (an

Sequential files, In this section, we will discuss about Sequential file or...

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

Properties of a red-black tree, Any binary search tree must contain followi...

Any binary search tree must contain following properties to be called as a red-black tree. 1. Each node of a tree should be either red or black. 2. The root node is always bl

High-level and bubble algorithm , 1. Give both a high-level algorithm and a...

1. Give both a high-level algorithm and an implementation (\bubble diagram") of a Turing machine for the language in Exercise 3.8 (b) on page 160. Use the ' notation to show the co

Decision tree - id3 algorithm, Decision Tree - ID3 algorithm: Imagine ...

Decision Tree - ID3 algorithm: Imagine you only ever do one of the following four things for any weekend:   go shopping   watch a movie   play tennis   just

Functions for inserting and deleting at either end of deque, Q. Devise a re...

Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu

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