Reducing Computational Time in Ray Tracing

Authors

  • Darshit Patoliya Information and Technology Department, BVM Engineering College
  • Bhargav Ghodasara Information and Technology Department, BVM Engineering College
  • Vatsal Shah Assist. Prof., Information and Technology Department, BVM Engg. College,

Keywords:

Ray Tracing, kd-tree, Spatial Median Method

Abstract

Many computer graphics rendering algorithms use ray tracing to generate realistic and
high quality image. It is a method to convert 3D images in to the high quality 2D realistic image. In
original ray tracing algorithm we need millions of rays to produce the render image, by calculating
intersection of ray with image plane and characteristic of surface, color of pixel is determined. So
this process is time consuming and complex. In this paper we study some algorithms which reduce
the computational time of ray tracing.

Published

2014-04-25

How to Cite

Darshit Patoliya, Bhargav Ghodasara, & Vatsal Shah. (2014). Reducing Computational Time in Ray Tracing. International Journal of Advance Engineering and Research Development (IJAERD), 1(4), 24–28. Retrieved from https://ijaerd.com/index.php/IJAERD/article/view/23

Most read articles by the same author(s)