Ray Tracing on GPUs

Tom Morris Feist, Florian Wende
Institut fur Informatik, Fachbereich Mathematik und Informatik, Freie Universitat Berlin
Freie Universitat Berlin, 2012
@article{feist2012ray,

   title={Ray Tracing on GPUs},

   author={Feist, Tom Morris and Wende, Florian},

   year={2012}

}

Download Download (PDF)   View View   Source Source   
The ray tracing method aims for producing realistic and high-quality images of a scene described by geometric primitives such as triangles, spheres, etc. The basic idea is quiet simple and allows for straight forward implementations of this technique on the computer. At its core is a set of rays, each of which corresponding to one of the image’s pixels in the 1st order. These rays then are traced through the scene we want to create an image of. For each ray-primitive pair an intersection test is performed. If there are actually primitives that have a 3D point in common with the ray, we are to find out the intersection point which is closest to the respective pixel, and for that point we need to evaluate the (Phong) lighting equation. As a result, for each pixel we get its color, giving us a first impression of the scene. It is quiet obvious that the image based on this 1st-order-rays-only approach is far away from what we consider "realistic" and "high-quality". For this reason, it is usual to also take higher than 1st order rays into account. That is, for each ray the closest intersection point (if there is any) becomes the origin of new rays; and for these rays the whole procedure also applies, yielding a hierarchy of rays for each pixel. In this way, it is possible to incorporate reflection and refraction effects, making the image appear more realistic. As the computational amount of the entire procedure grows linearly with the number of pixels considered (and exponentially with the depth of the ray hierarchy for each pixel) and the complexity of the scene, it becomes necessary to introduce efficient data structures that help reduce the overall computational amount. Since the most expensive part of the ray tracing procedure is ray-primitive intersection testing, an efficient traversal method for the scene is required. Amongst further algorithmically optimizations, this report also focuses on how to speed up computations by means of multi processor architectures; multi-core CPUs and GPUs namely.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

You must be logged in to post a comment.

* * *

* * *

* * *

Free GPU computing nodes at hgpu.org

Registered users can now run their OpenCL application at hgpu.org. We provide 1 minute of computer time per each run on two nodes with two AMD and one nVidia graphics processing units, correspondingly. There are no restrictions on the number of starts.

The platforms are

Node 1
  • GPU device 0: AMD/ATI Radeon HD 5870 2GB, 850MHz
  • GPU device 1: AMD/ATI Radeon HD 6970 2GB, 880MHz
  • CPU: AMD Phenom II X6 @ 2.8GHz 1055T
  • RAM: 12GB
  • OS: OpenSUSE 11.4
  • SDK: AMD APP SDK 2.8
Node 2
  • GPU device 0: AMD/ATI Radeon HD 7970 3GB, 1000MHz
  • GPU device 1: nVidia GeForce GTX 560 Ti 2GB, 822MHz
  • CPU: Intel Core i7-2600 @ 3.4GHz
  • RAM: 16GB
  • OS: OpenSUSE 12.2
  • SDK: nVidia CUDA Toolkit 5.0.35, AMD APP SDK 2.8

Completed OpenCL project should be uploaded via User dashboard (see instructions and example there), compilation and execution terminal output logs will be provided to the user.

The information send to hgpu.org will be treated according to our Privacy Policy

HGPU group © 2010-2014 hgpu.org

All rights belong to the respective authors

Contact us:

contact@hgpu.org