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

Filled-area primitives - output primitives, Filled-Area Primitives  Fil...

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

Use the midpoint circle algorithm to get the output, Figure uses three dash...

Figure uses three dashed arcs and one small circle. Dashed line or arc is a style attribute that can be attached with a line or a curve. In OpenGL you can use the line stipple func

Data set, In this project, the image data set consists of 320 training imag...

In this project, the image data set consists of 320 training images and 285 test images. Table 1 shows the image data set in details. In addition to the original images, th

Containment test - visible surface detection, Containment Test -  visible s...

Containment Test -  visible surface detection Test: That is Containment test: it can be either comprised (contained) or surrounding polygon, if intersection test fails. The

Polygon representation methods - space partitioning, Polygon representation...

Polygon representation methods - Space Partitioning Representations Space partitioning representations: this type of representation is used for explain the interior pr

Distinguish between convex and concave polygons, Distinguish between convex...

Distinguish between convex and concave polygons? If the line joining any two points in the polygon lies totally inside the polygon then, they are called as convex polygons. If

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

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