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
expalin 3-dimentional display methods

Write a simple C-code to generate a circular arc between two angle values. Use this to draw Figure.

Introduction To Computer Graphics Early man employed drawings to communicate even before he learnt to communicate, write or count. Incidentally, these earliest hierogly

Sprite animation interactive, may be non rectangular (Computer games) In its simplest form it is a 2-D graphic object which moves across the display. Sprites frequently can hav

Zero Acceleration (Constant Speed ) Now, the time spacing for the in-betweens that is: in-between frames is at equal interval; which is if, we want N in-betweens for key frames

In computers, colours are created by blending different combinations of red, green and blue. These colours are normally specified as three two-digit hexadecimal numbers in html, ph

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

Accessories : A Screen Grabber is a necessary accessory. Bitmap images are so common in multimedia, that it is important to have a tool for grabbing all or part of the screen disp

List out the merits and demerits of Penetration methods?  The merits and demerits of the Penetration methods are as follows  It is a less expensive technique It has

Web Design and Editing To edit and make a website, the big three softwares are use: 1)   DreamWeaver (MacroMedia) 2)   Frontpage (MicroSoft) 3)   Go Live (Adobe) 4)