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

Array implementation of a circular queue, A circular queue can be implement...

A circular queue can be implemented through arrays or linked lists. Program 6 gives the array implementation of any circular queue. Program 6: Array implementation of any Circu

Sorting algorithm is best if the list is already sorted, Which sorting algo...

Which sorting algorithm is best if the list is already sorted? Why? Insertion sort as there is no movement of data if the list is already sorted and complexity is of the order

Tower of hanoi problem., Write an algorithm for getting solution to the Tow...

Write an algorithm for getting solution to the Tower's of Hanoi problem. Explain the working of your algorithm (with 4 disks) with appropriate diagrams. Ans: void Hanoi(int

Conversion of general trees to binary trees, Taking a suitable example expl...

Taking a suitable example explains how a general tree can be shown as a Binary Tree. Conversion of general trees to binary trees: A general tree can be changed into an equiv

Data type, Data type An implementation of an abstract data type on a...

Data type An implementation of an abstract data type on a computer. Therefore, for instance, Boolean ADT is implemented as the Boolean type in Java, and bool type in C++;

Double linked list, In a doubly linked list, also called as 2 way list, eac...

In a doubly linked list, also called as 2 way list, each node is divided into 3 parts. The first part is called previous pointer field. It contains the address of the preceding

Methods of collision resolution, Methods of Collision Resolution 1)  Co...

Methods of Collision Resolution 1)  Collision Resolution by separate chaining  2)  Collision Resolution by open addressing

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 ?

Program for linear search, Program for Linear Search. Program: Linear S...

Program for Linear Search. Program: Linear Search /*Program for Linear Search*/ /*Header Files*/ #include #include /*Global Variables*/ int search; int

If, 1. Start 2. Get h 3. If h T=288.15+(h*-0.0065) 4. else if h T=2...

1. Start 2. Get h 3. If h T=288.15+(h*-0.0065) 4. else if h T=216.65 5. else if h T=216.65+(h*0.001) 6. else if h T=228.65+(h*0.0028) 7. else if h T=270.65 8.

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