What are the specific needs for realism, Data Structure & Algorithms

Assignment Help:

What are the Specific needs for realism

The graphical representation of solids are better dealt in 3-D graphics for visualization,  which had to take the mathematical model and line representations typically as and bring them up to the realism of the real world, which meant the following :

(a) Most real objects are opaque, and we only see the lines and surfaces at front.  Those portions at the back had, therefore, to be eliminated from the mathematical model before plotting. We will discuss this under "Hidden-Line and Surface Removal", which can also be referred to as Visible Surface Identification.

(b) All real objects appear smaller as they are farther from us, with parallel lines converging away from us. Hence, except for construction and fabrication drawings and scientific graphs, which should avoid spatial distortion, perspective projection as in Figure 3.1(c) should be preferred for all 3-D viewing. We will discuss this under "Perspective Projection".

(c) All real objects exhibit surface characteristics due to two causes, namely the surface textures, and the effect of the light falling on them. Thus, blank areas or flat shades of gray or colour must be enhanced to simulate actual surfaces. We shall discuss this under "Surface Renderings".

 


Related Discussions:- What are the specific needs for realism

Explain principle of optimality, Explain principle of Optimality It ind...

Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of  optimal solutions to its subinstances.

Algorithm to find maximum and minimum numbers, Give an algorithm to find bo...

Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.

How do collisions happen during hashing, How do collisions happen during ha...

How do collisions happen during hashing? Usually the key space is much larger than the address space, thus, many keys are mapped to the same address. Assume that two keys K1 an

Data communication, #question.explain different types of errors in data tra...

#question.explain different types of errors in data transmission.

Algorithm to merge the lists together, Q. Let X = (X1, X2, X3,....Xn) and Y...

Q. Let X = (X1, X2, X3,....Xn) and Y= (Y1, Y2, Y3,....Xm) be the two linked lists respectively. Write down an algorithm to merge the lists together to get the linked list Z such th

Nested for loop, nested for loop for (i = 0; i for (j = 0; j seq...

nested for loop for (i = 0; i for (j = 0; j sequence of statements } } Here, we observe that, the outer loop executes n times. Every time the outer loop execute

Single pointer pointing to the tail of the queue, Can a Queue be shown by c...

Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

Rooted tree, It does not have any cycles (circuits, or closed paths), which...

It does not have any cycles (circuits, or closed paths), which would imply the existence of more than one path among two nodes. It is the most general kind of tree, and might be co

Write down a module to merge two linked lists, Two linked lists are having ...

Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted merge(struct node *p, stru

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