Ray tracing algorithm, Computer Graphics

Assignment Help:

Ray Tracing:  Ray t racing is the technique to determine which objects in the scene are visible.  In this to identify the visible surface for each pixel we continue to bounce the ray around the scene and collecting intensity contributions. This provides a simple and powerful rendering technique for obtaining global reflection and transmission effects. The basic ray tracing algorithm also provides for visible surface detection shadow effects transparency and multiple light source illumination.  For each scan line the intensity at the interaction of the scan line with a polygon edge is linearly interpolated from the intensities at the edge end points. For example the polygon edge with end point vertices at position 1 & 2 is intersected by the scan line at point 4. A fast method for obtaining the intensity at point 4 is to interpolate lower intensities I1 & I2 using only the vertical displacement of the scan line.  


Related Discussions:- Ray tracing algorithm

Bezier surfaces - modeling and rendering, Bezier Surfaces - Modeling and Re...

Bezier Surfaces - Modeling and Rendering Two sets of Bezier curve can be utilized to design an object surface by identifying by an input mesh of control points. The Bézier su

What happens while two polygons have similar z value , What happens while t...

What happens while two polygons have similar z value and the z-buffer algorithm is utilized? Solution : z-buffer algorithms, varies colors at a pixel if z(x,y)

Perform a x-direction shear transformation, 1. If you perform a x-direction...

1. If you perform a x-direction shear transformation and then a y-direction shear transformation, will the result be the same as the one which is obtained when it is simultaneous s

Explain the acoustic properties of sound, Problem: (a) What is meant b...

Problem: (a) What is meant by ‘Time - Stretching ‘in relation to a sound data file? (b) Calculate the size of a 5 minutes mono sound file of CD quality and with a 16 -bit

Deffrent, deffrent between vecgen algorithm and bresenham line algorithm in...

deffrent between vecgen algorithm and bresenham line algorithm in computer graphic

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

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

Sequencing of animation design, Sequencing of Animation Design Previous...

Sequencing of Animation Design Previously we have discussed many things regarding the traditional and current trends of computer created animation although now it is time to pr

What is meant by addressability, What is meant by Addressability? Ans. ...

What is meant by Addressability? Ans. Addressability is the number of individual dots per inch (d.p.i.) that can be formed. If the address of the current dot is (x, y) then the

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