An efficient algorithm for ray tracing

This paper presents a new algorithm that performs more efficient ray tracin g compared to existing algorithms. This algorithm is based on the "divide-a nd-conquer" technique well known from the area of lists sorting, and speeds up the intersections and light-visibility tests for the first hit. A new d efinition of transitive-between-relations (TBR) is introduced. A simple sho oting ray guide is embedded into a conventional ray tracer to reduce the nu mber of intersection tests and thus speed-up the first hit calculation and the associated light conditions tests. The algorithm was tested in environm ents made up of convex polygons (random triangles, linearly positioned pyra mids) but it can be used in environments with other primitives.