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 all-pair shortest-paths problem, Explain All-pair shortest-paths pr...

Explain All-pair shortest-paths problem Given a weighted linked graph (undirected or directed), the all pairs shortest paths problem asks to find the distances (the lengths of

Simulation of queues, Simulation of queues: Simulation is the process of f...

Simulation of queues: Simulation is the process of forming an abstract model of a real world situation in order to understand the effect of modifications and the effect of introdu

Sparse matrix, what are the disadvantages of sparse matrix?

what are the disadvantages of sparse matrix?

Rules for abstract data type-tree, null(nil) = true                     // ...

null(nil) = true                     // nil refer for empty tree null(fork(e, T, T'))= false   //  e : element , T and T are two sub tree leaf(fork(e, nil, nil)) = true leaf(

Full binary trees, Full Binary Trees: A binary tree of height h that had 2...

Full Binary Trees: A binary tree of height h that had 2h -1 elements is called a Full Binary Tree. Complete Binary Trees: A binary tree whereby if the height is d, and all of

Multilist file organisation, what is multilist length file organisation? ex...

what is multilist length file organisation? explain with an example

Push and pop operations, Q. Explain that how do we implement two stacks in ...

Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.

Naïve recursive algorithm for binomial coefficients, How many recursive cal...

How many recursive calls are called by the naïve recursive algorithm for binomial coefficients, C(10, 5) and C(21, 12) C(n,k){c(n-1,k)+c(n-1,k-1) if 1 1 if k = n or k = 0

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