Fast Ray Tracing for Modern General Purpose CPU

We present a study of the system implications of various aspects of the classic Ray Tracing algorithm. We show how these algorithms can be modified to yield the highest performance on any given system, and present some of the results that we obtained.

[1]  Vlastimil Havran,et al.  On Improving KD-Trees for Ray Shooting , 2002 .

[2]  Kellogg S. Booth,et al.  Report from the chair , 1986 .

[3]  Marco Pellegrini,et al.  Stabbing and ray shooting in 3 dimensional space , 1990, SCG '90.

[4]  Michael Wimmer,et al.  Visibility preprocessing for urban scenes using line space subdivision , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

[5]  Vlastimil Havran,et al.  Heuristic ray shooting algorithms , 2000 .

[6]  Vlastimil Havran,et al.  LCTS: Ray Shooting using Longest Common Traversal Sequences , 2000, Comput. Graph. Forum.

[7]  Philipp Slusallek,et al.  State of the Art in Interactive Ray Tracing , 2001, Eurographics.