Consider shiny surface with diffused reflection coefficient, Computer Graphics

Assignment Help:

Consider a Shiny Surface Along With Diffused Reflection coefficient

Consider a shiny surface along with diffused reflection coefficient of 0.8 and ambient reflection coefficient of 0.7, the surface has standard in the direction of 2i + 3j +4k; as several light is incident on it from the direction i + j + k hence the ambient and diffused intensities are of order 2 and 3 units. Find out the intensity or reflected light.

Solution: The combined consequence of ambient and diffused reflection is specified by:

I = Ia Ka + Id Kd cos θ = Ia Ka + Id Kd ( N¯ .L¯)

By using the data specified in the equation we find:

I = 2 * 0.7 + 3 * 0.8 * ((2i + 3j + 4k).(i +j +k))

= 1.4 + 2.4 (2 + 3 + 4)

= 1.4 + 9*2.4

= 23


Related Discussions:- Consider shiny surface with diffused reflection coefficient

How to control the contents of the video buffer, OBJECTIVE Since graphic...

OBJECTIVE Since graphics plays a very important role in modern computer application, it is important to know more information about its hardware and software operations. Despite

Differentiate between lossy and lossless compression, Question: (a) Di...

Question: (a) Differentiate between lossy and lossless compression. (b) State the uses of the two compression standards MPEG-1 and MPEG-2. (c) State three areas where

Image precision, what is image precision in computer graphics

what is image precision in computer graphics

Define random scan and raster scan displays, Define Random Scan/Raster Scan...

Define Random Scan/Raster Scan displays. Ans. Random scan is a process in which the display is made by the electronic beam, which is directed, only to the points or division of

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Sutherland hodgeman polygon clipping algorithm, What is clipping? Explain S...

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of p

Normalization transformation, Find the normalization transformation N, whic...

Find the normalization transformation N, which uses the rectangle W(1, 1); X(5, 3); Y(4, 5) and Z(0, 3) as a window and the normalized deice screen as viewpoint.

Ray tracing - polygon rendering & ray tracing methods, Ray Tracing - Polygo...

Ray Tracing - Polygon Rendering & Ray Tracing Methods Ray tracing obeys all rays from the eye of the viewer back to the light sources. The method Ray tracing is very good at

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