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

The time and space complexities of an algorihm, Relation between the time a...

Relation between the time and space complexities of an algorithm The examining of algorithm focuses on time complexity and space complexity. As compared to time analysis, the a

Technique for direct search, Technique for direct search is    Hashing ...

Technique for direct search is    Hashing is the used for direct search.

File organization, Define File organization''s and it''s types

Define File organization''s and it''s types

Reverse order of elements on a slack, Q. Describe the representations of gr...

Q. Describe the representations of graph. Represent the graph which is given to us using any two methods Ans: The different ways by which we can represent graphs are:

linear-expected-time algorithm, Implement a linear-expected-time algorithm...

Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

Applications of binary trees, In computer programming, Trees are utilized ...

In computer programming, Trees are utilized enormously. These can be utilized for developing database search times (binary search trees, AVL trees, 2-3 trees, red-black trees), Gam

Circularly linked lists implementation, CIRCULARLY LINKED LISTS IMPLEMENTAT...

CIRCULARLY LINKED LISTS IMPLEMENTATION A linked list wherein the last element points to the first element is called as CIRCULAR linked list. The chains do not specified first o

Enumerate about the carrier set members, Enumerate about the carrier set me...

Enumerate about the carrier set members Ruby is written in C, so carrier set members (which is, individual symbols) are implemented as fixed-size arrays of characters (which is

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