Consider shiny surface with diffused reflection coefficient, Computer Graphics

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

Posted Date: 4/5/2013 2:36:34 AM | Location : United States







Related Discussions:- Consider shiny surface with diffused reflection coefficient, Assignment Help, Ask Question on Consider shiny surface with diffused reflection coefficient, Get Answer, Expert's Help, Consider shiny surface with diffused reflection coefficient Discussions

Write discussion on Consider shiny surface with diffused reflection coefficient
Your posts are moderated
Related Questions
Steps uses in the Cohen Sutherland Line Clipping Algorithm are: Figure: Steps for Cohen Sutherland Line Clipping STEP 1: Input:  x L , x R , y T , y B

Authoring Tools Authoring tools generally refers to computer software that assists multimedia developers produce products. Authoring tools are various from computer programmi

If the spacing between the knot sequence is uniformly doubled, will the shape of the resulting B-spline curve change?  Justify your answer.

Filled-Area Primitives  Filled-area primitives are one of the most important types of primitives used in Computer Graphics.  Basically filled-area primitives are meant to fill

Characteristics of Bitmap Data: Bitmap data can take up many rooms. A CMYK A-4 size picture which is optimized for medium quality printing (150 lpi) takes up 40 Mage Bytes. Compre

Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background

Scan Line Algorithm A scan line algorithm determines the overlap intervals of the polygon with each scan line to obtain interior points of the polygon for assigning those point

What is bitmap and what is pixmap?  The frame buffer used in the black and white system is called as bitmap which take one bit per pixel. For systems with many bits per pixel,

View Volumes and General Projection Transformations You have to remember that the view volume is the volume which sets up near and far extents, top and bottom extents and left

Three Sub-Fields of Computer Simulation Computer simulation is the electronic equivalent of this kind of role playing and it functions to drive synthetic environments and virt