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
Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from

Example 1: Draw line segment from point (2, 4) to (9, 9) by using Digital Differential Analyzer algorithm. Solution: We know usual equation of line is specified via y = mx

I have an assignment to do & it''s due on Wednesday !

1. Implement the boundary fill algorithm and flood fill algorithm in C-language and use your code to fill two different types of closed areas such as  i)  A Circle ii)  A sel

what languge do computers speak

Picture Information - Raster Graphics and  Clipping Now, the picture information is accumulated in the form of bit plans on which all bit plane complete information of pictur

Explain about the Computer Based Training CBT makes use of a computer system to train people in numerous applications. It makes use of self-assessment and multimedia with minim

Horizontal retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the left most point on the next horizontal line after refresh

what is refresh buffer/ identify the content and organisation of the refresh buffer for the case of raster display and vector display.

Modelling and Rendering a surface Common practice in modelling and rendering a surface is to approximate it by a polygonal surface.  By a polygonal surface we mean a surface whi