Ray tracing algorithm - recursive, Computer Graphics

Ray Tracing Algorithm - Recursive

Frequently, the basic ray tracing algorithm is termed as a "recursive" acquiring an outcome wherein a given process repeats itself an arbitrary number of times algorithm. Unlimited recursion is recursion which never ends. The ray tracing algorithm, moreover, is recursive, although it is finitely recursive. This is significant, since otherwise you would begin an image rendering and it would never end! The algorithm begins, as in ray casting, through shooting a ray from the eye and by the screen, finding all the objects which intersect the ray, and determining the nearest of such intersections.

It after that recourses or repeats itself through shooting more rays by the point of intersection to observe what objects are reflected at such point, what objects may be seen by the object at that point, that light sources are directly visible from such point, and so on. These extra rays are frequently termed as secondary rays to differentiate them from the original, primary ray. By an analysis of the above discussion we can say as we pay for the raised characteristics of ray tracing through a dramatic increase in time spent along with calculations of point of intersections along with both the primary rays as in ray casting and all secondary and shadow rays. Therefore achieving good picture quality is not a simple task, and it only acquires more expensive as you try to get more realism in your image. One more idea termed as Anti- aliasing is yet to be discussed, that plays a dominant role in achieving the goal of realism.

Posted Date: 4/5/2013 5:12:44 AM | Location : United States







Related Discussions:- Ray tracing algorithm - recursive, Assignment Help, Ask Question on Ray tracing algorithm - recursive, Get Answer, Expert's Help, Ray tracing algorithm - recursive Discussions

Write discussion on Ray tracing algorithm - recursive
Your posts are moderated
Related Questions
Principle Vanishing point - Perspective Projections Assume that line 1 and l2 be two straight lines parallel to each other that are also parallel to x-axis. If the projection

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)

Normal 0 false false false EN-US X-NONE X-NONE

Distinguish between parallel and perspective projection Parallel Projection Perspective projection Coordinate position are transformed

1. Compare Bresenham line generation with Digital Differential Analyzer line generation. Ans.   Bresenham line generation algorithm is better than Digital Differential Analyze

Other Video File Formats: There are several the other formats for storing video in the digital formats. Such formats are usually used for the storage and viewing of video through

Advantages of Scan line Algorithm:   This time and always we are working along with one-dimensional array as: x[0...x_max] for color not a 2D-array like in Z-buffer algorithm.

The goal of this assignment is to implement procedures/functions using x86 assembly. In addition to implementing procedures/functions, this assignment requires to pass arguments us

self test exercise 17 asked you to overload the operator >> and the operator Overload biinary operator + to add pairs according to the rule (a, b) + (c, d) = (a + c, b, + d) overl

1.   Distinguish among Scan line polygon fill and Seed fill or Flood fill algorithm? Scan Line Polygon Flood Fill Algorithms ?1. This