Common principles of ray tracing, Computer Graphics

Assignment Help:

Common Principles of Ray Tracing

Based upon the nature or attributes of the surface given by the user, the subsequent effects are implemented, as per to rules of optics:

 a)  Reflection (as per to the angle of incidence and reflectivity of the surface).

 b) Refraction (as per to the angle of incidence and refraction index).

 c) Display of renderings that is texture or pattern as given, or shadows i.e. on the next nearest object or background concerning transparency or opacity, like the case may be.

903_Common Principles of Ray Tracing.png

Figure demonstrates some of the common principles of ray tracing.

A ray start from O hits the transparent glass plate P at an angle i.e. A. Then it gets refracted in the plate specified by the kink inside the plate thickness. The exiting ray occurs to hit the edge of the triangle i.e. 'T' and casts a shadow upon the opaque rectangular plate i.e. 'R' at the point C. A portion of the ray incident on the plate P gets reflected at 'A' and the reflected ray hits the elliptical object 'E' at the point 'D'. If P is a green glass plate, the exiting ray AC will be allocated the suitable green colour. If R or E has a textured surface, the consequent point C or D will be specified the attributes of the surface rendering.

If O is a point source of light, the ray OC will position the shadow of the point B upon the edge of the triangle T on the point C at the rectangle 'R'. Diverse locations of light sources may be combined along with be different view positions to enhance the realism of the scene. The way is common also in the sense which it can apply to curved surfaces and also to solids made of flat polygonal segments. Due to its versatile and wide applicability, this is a "brute force" method, concerning massive computer resources and great computer effort.


Related Discussions:- Common principles of ray tracing

Draw line segment - digital differential analyzer algorithm, 1. By using D...

1. By using Digital Differential Analyzer algorithm draw line segments from point (1,1) to (9,7). Ans. We see that the usual equation of the line is specified by: y = mx+c

How we create virtual reality images for use on a computers, How we create ...

How we create virtual reality images for use on a computer system When a virtual tour of, for instance, a house is shown on a website the images need to be first created and th

Scan conversion of line with the slope, Scan Conversion of Line with the sl...

Scan Conversion of Line with the slope (0 Currently the pixel positions beside the line path are determined through sampling at Unit x intervals that is, starting from the fi

Raster and random scan displays - hardware primitive, Raster and random sca...

Raster and random scan displays In Raster scan displays, whole screen is refreshed a number of times in a second to keep the picture visible on the screen. This is called refre

Sequence of steps to generate a full animation, Sequence of Steps to Genera...

Sequence of Steps to Generate a Full Animation The sequence of steps to generate a full animation would be as given below: 1)  Improve a script or story for the animation.

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Open Gl, Write a program in C/C++ using OpenGL to create (without using bui...

Write a program in C/C++ using OpenGL to create (without using built in function) a square by implementing shear algorithm along 1. X-axis, 2.Y-axis.

Ray tracing algorithm, Ray Tracing:  Ray t racing is the technique to dete...

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

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

deffrent between vecgen algorithm and bresenham line algorithm in computer graphic

Algorithm scan-line, Algorithm (scan-line): For each scan line perform ...

Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background

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