Variation of intensity - modeling and rendering, Computer Graphics

Assignment Help:

Variation of Intensity - Modeling and Rendering

According to the phong model the variation of Intensity (I) along with α (since I α cosnα) is:

239_Variation of Intensity - Modeling and Rendering.png

i) for shiny surface (n > 1)

1825_Variation of Intensity - Modeling and Rendering 1.png

ii) Dull surface  (n ~= 1)

By the Phong specular reflection as:

I or Ispec. = Is Ks cosnα

Here,    Is → intensity of source

  I OR Ispec → intensity of specular reflected light

 Ks → Specular reflection coefficient effecting intensity in the case while all ambient or diffuse or specular reflection arises as:

I = Ia Ka + Id Kd cos θ + Is Ks cosnα  

Now, cosn α= (R¯ V¯)n        (?  Qcosnα =  R¯ V¯).

Here,

R¯ → Unit vector in specular reflection direction 

V¯ → Unit vector pointing the viewer

It is | V¯  |  = 1 ;  | R¯ |  = 1.

R¯ V¯=  | R¯ | | V¯ | cos α = 1.1. cos α = cos α.

  ( ⇒ cos α = R¯ V¯)


Related Discussions:- Variation of intensity - modeling and rendering

Lcd - liquid crystal display, LCD - Liquid Crystal Display A liquid...

LCD - Liquid Crystal Display A liquid crystal display consists of two glass plates each containing a light polarizer. One glass plate contains vertical polarizer and the ot

Bresenham line generation algorithm, Bresenham Line Generation Algorithm ...

Bresenham Line Generation Algorithm This algorithm is exact and efficient raster line generation algorithm. Such algorithm scan converts lines utilizing only incremental integ

Time delay and busy flag method, 1. Using a time Delay Method The delay...

1. Using a time Delay Method The delay required between issuing each character to the LCD is about 5-10ms (it's simply known as DELAY). When programming an LCD, a long delay is

Student, hi I need help with photoshop

hi I need help with photoshop

Boundary-fill algorithm or flood-fill algorithm , boundary-fill algorithm o...

boundary-fill algorithm or flood-fill algorithm As you saw the implementation of scan line polygon fill requires that boundaries should be straight line segments.  The seed fi

Cases for digital differential analyzer algorithm, Cases for Digital Differ...

Cases for Digital Differential Analyzer Algorithm 1)  If in case 1, we plot the line another way round that is, moving in y direction via 1 unit every time and after that hunt

Test for checking disjoint polygons by using of min-max test, Test For chec...

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

Midpoint circle algorithm for scan converting a circle, Explain Bresenham s...

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle

Important points about the surface of revolution, Important points about th...

Important points about the Surface of Revolution a) if a point on base curve is given by parametric form, that are: (x(u), y(u), z(u)) so surface of revolution regarding to th

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