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

Basic tests - producing polygon surface, Basic Tests - Producing Polygon Su...

Basic Tests - Producing Polygon Surface A few basic tests that must be performed before producing a polygon surface through any graphic package as: 1) All vertexes are list

Design and functioning of a refresh cathode ray tube, Design and functionin...

Design and functioning of a refresh cathode ray tube Primary components of refresh cathode ray tube are (i) electron gun used in producing electron beam (ii) heating fila

Objectives of viewing ttransformation, Objectives of Viewing transformation...

Objectives of Viewing transformation After going through this section, you should be capable to: - Explain the projection; - Classify different types of Perspective and

Application areas of computer graphics, Explain application areas of comput...

Explain application areas of computer graphics in different areas.    Early computer graphics has only certain special capabilities such as straight lines circles and ellipses

Explain the bresenham line generation algorithm, 1. Explain the Bresenham ...

1. Explain the Bresenham line generation algorithm via digitizing the line with end  points as (15, 5) and also (25,13). Ans. Now we are utilizing the Bresenham line generati

Assumption for diffuse reflection - polygon rendering, Assumption for Diffu...

Assumption for Diffuse Reflection - Polygon Rendering  i) the diffuse reflections by the surface are scattered along with equal intensity in each direction, independent of vie

Midpoint circle generation algorithm, Midpoint circle generation algorithm ...

Midpoint circle generation algorithm This makes use of a circle function. Based on this circle function, a decision parameter is created which is used to decide successive pixe

Cohen sutherland algorithm - 2d clipping algorithms, Cohen Sutherland algor...

Cohen Sutherland algorithm Point clipping is very simple.  All you need to check is whether a point is inside the window extremes in x- and y-directions.  For line clipping sev

Interactive 3d computer graphics, Describe interactive model of computer gr...

Describe interactive model of computer graphics and application areas of interactive computer graphics.

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

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