Orientation dependence - modeling and rendering, Computer Graphics

Assignment Help:

Orientation Dependence - Modeling and Rendering

The outcomes of interpolated-shading models are dependent of the projected polygon's orientation. Because values are interpolated among vertices and across horizontal scan lines, the results may be different when the polygon is rotated. This consequence is mainly obvious when the orientation modifies slowly among successive frames of an animation. A same problem cab also happens in visible-surface determination while the z value at each point is interpolated by the z values allocated to each vertex. Both issues can be resolved through decomposing polygons into triangles. Instead, the solution is rotation- independent, although expensive, interpolation methods which solve problem without the requirement for decomposition.


Related Discussions:- Orientation dependence - modeling and rendering

Explain about the computer based training, Explain about the Computer Based...

Explain about the Computer Based Training CBT makes use of a computer system to train people in numerous applications. It makes use of self-assessment and multimedia with minim

Derive the single combined transformation matrix, A 2D geometric shape is r...

A 2D geometric shape is rotated about a point with coordinates (1,2)  by 90°  in a clockwise direction.  Then, the shape is scaled about the same point in the x-coordinate by 2 tim

Determine the refresh rate in the raster system, Example 1 : Determine the ...

Example 1 : Determine the number of memory bits essential for three bit plane frame buffer for the 512 x 512 raster Solution: Whole memory bits needed are 3 x 512 x 512 = 786,

Three dimensional display methods - 2d clipping algorithms, Three dimension...

Three dimensional display methods: Among the simplest three dimensional surface representations are the polygonal surfaces.  A polygonal surface is described by vertices

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

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

Interactive Computer Graphics, Explain the different input modes used in in...

Explain the different input modes used in interactive computer graphics.

Ray tracing algorithm - recursive, Ray Tracing Algorithm - Recursive ...

Ray Tracing Algorithm - Recursive Frequently, the basic ray tracing algorithm is termed as a "recursive" acquiring an outcome wherein a given process repeats itself an arbitr

Modelling and rendering a surface, Modelling and Rendering a surface Com...

Modelling and Rendering a surface Common practice in modelling and rendering a surface is to approximate it by a polygonal surface.  By a polygonal surface we mean a surface whi

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