Intensity of specular reflection - modeling and rendering, Computer Graphics

Assignment Help:

Intensity of Specular Reflection - Modeling and Rendering

Intensity of specular reflection based upon material properties of surface and the angle of incidence and the value of specular reflection parameter 'n' is found through the category of surface which we need to display.

- Shiny surfaces are modeled along with larger values of n (100 or may be more)

- Dull surfaces are modeled along with smaller values of n (down to 1)

- For ideal reflection n is ∞.

- For extremely dull surfaces (example: chalk and so no) n is assigned value close to 1.

- In the diagram demonstrated below we can see how the function (cos a)n behaves for various values of n.


Related Discussions:- Intensity of specular reflection - modeling and rendering

Line clipping algorithm - cohen sutherland algorithm, Line Clipping Algorit...

Line Clipping Algorithm - Cohen Sutherland Algorithm Line is a series of endless number of points; here no two points contain space in among them. Hence, the above said inequa

B splines, What is uniform rational splines

What is uniform rational splines

Plane equation - curves and surfaces, Plane Equation - Curves and Surfaces ...

Plane Equation - Curves and Surfaces Plane is a polygonal surface that bisects its environment in two halves. One is termed to as forward and another as backward half of som

Side effects due to scan conversion, What are the side effects due to scan ...

What are the side effects due to scan conversion? How can the effects be minimized? Aliasing Effects (Side effects of scan conversion)   Scan conversion is essentially a syst

Reflection, Determine the transformation matrix for the reflection, Compute...

Determine the transformation matrix for the reflection, Computer Graphics

Non trivial case of cohen sutherland line clippings, Non Trivial Case of co...

Non Trivial Case of cohen sutherland line clippings Case: assume for the line segment PQ, both the trivial rejection and acceptance tests failed (that is, Case 1 and Case 2

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

Curved surfaces, Build a program that allows: 1. using mouse or keyboard...

Build a program that allows: 1. using mouse or keyboard to move around on a set of 16 control points;  2. modify the value (drag along x, y, or z) of a point;  3. display

Unrepresentative vertex normals - modeling and rendering, Unrepresentative ...

Unrepresentative vertex normals - Modeling and Rendering Calculated vertex normals may not adequately present the surface's geometry. For illustration, if we calculate vertex

Carry out a perspective projection, Consider the line segment AB in 3-Dimen...

Consider the line segment AB in 3-Dimentional parallel to the z-axis along with end points A (- 5,4,2) and also B (5,-6,18). Carry out a perspective projection upon the X=0 plane;

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