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

Subdivision of polygon - visible surface detection , Subdivision of polyg...

Subdivision of polygon Test to find out the visibility of a single surface are made through comparing surfaces that as polygons P along regarding a specified screen area A.

Transformation, Explain window to view port transformation

Explain window to view port transformation

What is the standard video workflow, QUESTION 1. You are a consultant i...

QUESTION 1. You are a consultant in the field of video production and video editing. You haven been requested to participate in a debate over analog and digital video. Write

Cohen sutherland, explain cohen sutherland line clipping algorithm

explain cohen sutherland line clipping algorithm

What are the advantages of rendering by patch splitting, What are the advan...

What are the advantages of rendering by patch splitting?  i. It is fast-especially on workstations with a hardware polygon-rendering pipeline.  ii. Its speed can be varied b

Area filling algorithms - output primitives, Area Filling Algorithms Be...

Area Filling Algorithms Before we go ahead with area filling algorithms, a word about pixel addressing and object geometry. You know that line segments are discretized into fin

Scan line algorithm and seed fill algorithm, Scan line algorithm and seed f...

Scan line algorithm and seed fill algorithm Two basic approaches are followed in area filling on raster systems.  In the first approach overlap intervals for scan lines that cr

Display necessitate to store z-buffer?, Suppose here, one allows 256 depth ...

Suppose here, one allows 256 depth value levels to be employed. Approximately how much memory would a 512x512 pixel display necessitate to store z-buffer? Solution : A system w

Medicine-applications for computer animation, Medicine: this is very tough...

Medicine: this is very tough for a doctor to get inside a living human body and to observe what is occurrence. Computer animation once again comes in very helpful. Every particula

BINARY, WHAT THAT S MEANS 0001

WHAT THAT S MEANS 0001

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