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 graph traversal, Graph Traversal In many problems we wish to in...

Graph Traversal In many problems we wish to investigate all the vertices in a graph in some systematic order. In graph we often do not have any single vertex singled out as spe

Deletion of an element from the linked list, A LGORITHM (Deletion of an ele...

A LGORITHM (Deletion of an element from the linked list) Step 1  Begin Step 2  if the list is empty, then element cannot be deleted Step 3  else, if the element to be del

Preorder - postorder and inorder, 1) preorder, postorder and inorder 2) ...

1) preorder, postorder and inorder 2) The main feature of a Binary Search Tree is that all of the elements whose values is less than the root reside into the nodes of left subtr

Define abstract data type & column major ordering for arrays, Q1. Define th...

Q1. Define the following terms: (i) Abstract data type. (ii) Column major ordering for arrays. (iii)  Row major ordering for arrays. Q2. Explain the following: (i) A

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

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

Row major storage, Q. Take an array A[20, 10] of your own. Suppose 4 words ...

Q. Take an array A[20, 10] of your own. Suppose 4 words per memory cell and the base address of array A is 100. Find the address of A[11, 5] supposed row major storage.

Complete trees, This is a k-ary position tree wherein all levels are filled...

This is a k-ary position tree wherein all levels are filled from left to right. There are a number of specialized trees. They are binary trees, AVL-trees, binary search trees, 2

Binary search, An unsorted array is searched through linear search that sca...

An unsorted array is searched through linear search that scans the array elements one by one until the wanted element is found. The cause for sorting an array is that we search

Creation of doubly linked list, Program: Creation of Doubly Linked List ...

Program: Creation of Doubly Linked List OUTPUT Input the values of the element -1111 to come out : 1 Input the values of the element -1111 to come out : 2 Inpu

Efficiency of binary search, Each of the comparison in the binary search de...

Each of the comparison in the binary search decrease the number of possible candidates where the key value can be searched by a factor of 2 as the array is divided into two halves

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