Example of back face detection method, Data Structure & Algorithms

Assignment Help:

Example of Back Face Detection Method

To illustrate the method, we shall start with the tetrahedron (pyramid) PQRS of     Figure with vertices P (1, 1, 2), Q (3, 2, 3), R (1, 4, 1), and S (2, 4,0). It is obviously a convex object, re-entrant angles just not being possible with triangles. In this case we may be able to guess that the vertex S is behind the triangle PQR, and also that faces PQR and QRS are visible, and the other two faces PQS and PRS are hidden. But the computer must be able to decide for itself and we too cannot decide for more than one tetrahedron. So, let us start with the order PQR as counter-clockwise with the triangle facing the viewer, as shown by the arrows along the edges in Figure. Then, for the adjacent triangle QRS, at its common edge QR with the triangle PQR, the arrow must point in the opposite direction, namely from R to S as shown, and hence the vertices must indeed be ordered as RQS (or QSR, or SRQ), as in Figure 3.3(b).

The vertex sequences of the other two triangles are also followed by the same logic : For the  trianglePRS, from the common edge PR with triangle PQR, the vertex sequence must be PRS (or RSP, or SPR), as in Figure. We could have also used the common edge RS with triangle QRS to get the same result. For triangle PQS, from anyone of the three common edges with the other three triangular faces, the vertex sequence will be determined as PSQ (or SQP, or QPS), as in Figure.

 

1859_data structure.png


Related Discussions:- Example of back face detection method

Explain dijkstra''s algorithm, Explain Dijkstra's algorithm Dijkstra's ...

Explain Dijkstra's algorithm Dijkstra's algorithm: This problem is concerned with finding the least cost path from an originating node in a weighted graph to a destination node

Explain arrays, Arrays :- To execute a stack we need a variable called top,...

Arrays :- To execute a stack we need a variable called top, that holds the index of the top element of stack and an array to hold the part of the stack.

Define a procedure called make-avl-tree, This question deals with AVL trees...

This question deals with AVL trees. You must use mutable pairs/lists to implement this data structure: (a) Define a procedure called make-avl-tree which makes an AVL tree with o

Relation of time and space complexities of an algorithm, What is complexity...

What is complexity of an algorithm? What is the basic relation between the time and space complexities of an algorithm? Justify your answer by giving an example.

#, if two relations R and S are joined, then the non matching tuples of bot...

if two relations R and S are joined, then the non matching tuples of both R and S are ignored in

Explain the interfaces in ruby, Explain the Interfaces in Ruby Recall...

Explain the Interfaces in Ruby Recall that in object-oriented programming, an interface is a collection of abstract operations that cannot be instantiated. Even though Ruby i

Define the terms - key attribute and value set, Define the terms   ...

Define the terms     i) Key attribute     ii) Value set  Key attribute:  An entity  type  usually  has  an attribute  whose  values  are  distinct  fr

Frequency counts for all statements, Evaluate the frequency counts for all ...

Evaluate the frequency counts for all statements in the following given program segment. for (i=1; i ≤ n; i ++) for (j = 1; j ≤ i; j++) for (k =1; k ≤ j; k++) y ++;

Stack, infix to revrse polish

infix to revrse polish

Add the special form let to the metacircular interpreter, (1)  (i) Add the ...

(1)  (i) Add the special form let to the metacircular interpreter Hint: remember let is just syntactic sugar for a lambda expression and so a rewrite to the lambda form is all 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