(L) [2006/01/31] [Phantom] [Must-read material] Wayback!Havran's thesis on kd-trees (and other structures):
[LINK http://www.mpi-sb.mpg.de/~havran/DISSVH/phdthesis.html]
This thesis is pretty much the Bible of kd-tree generation and traversal.
Ingo Wald's stuff:
The OpenRT project: [LINK http://www.openrt.de/]
Thesis on realtime ray tracing: [LINK http://www.sci.utah.edu/~wald/PhD]
RTNews:
[LINK http://www.acm.org/tog/resources/RTNews/html/rtnv18n1.html]
Ray/Tri-mesh intersection benchmark:
[LINK http://homepages.paradise.net.nz/nickamy/benchmark.html]
Introduction to ray tracing, by me:
[LINK http://www.devmaster.net/articles/raytracing_series/part1.php]
Another interesting page for beginners:
[LINK http://www.mandelbrot-dazibao.com/Raytuto/Raytuto.htm]
Technical details of SIMD packet tracing, also by me:
[LINK http://www.intel.com/cd/ids/developer/asmo-na/eng/dc/threading/245711.htm]
Carsten Benthin's thesis on the OpenRT ray tracer:
[LINK http://graphics.cs.uni-sb.de/~benthin/final.pdf]
Toxie's (Carsten Wachter) paper on BIH:
[LINK http://graphics.uni-ulm.de/BIH.pdf]
Chapter 7 of the popular PBRT book, with tons of info on sampling:
[LINK http://graphics.stanford.edu/~mmp/chapters/pbrt_chapter7.pdf]
The Global Illumination Compendium:
[LINK http://www.cs.kuleuven.ac.be/~phil/GI/TotalCompendium.pdf]
More later.
(L) [2006/01/31] [tbp] [Must-read material] Wayback!Let me throw mine in too.
BVH:
# Brian Smits, [LINK http://www.cs.utah.edu/%7Ebes/papers/fastRT/paper-node12.html "Efficiency issues for ray tracing"].
Describes how to transform a BVH hierarchy into an array with skip pointers allowing for a cheap iterative traversal.
# Markus Geimer and Stefan Müller, [LINK http://www.uni-koblenz.de/%7Ecg/publikationen/cp_raytrace.pdf "A Cross-Platform Framework for Interactive Ray Tracing"]
Discusses a SIMD implementation, comes with a nice SIMD slabs test.
# [LINK http://www.cg.cs.tu-bs.de/bs_root/people/mueller/publications/gm_diss_online_300dpi.pdf]
Mueller proposes another pass to detect clusters in a BHV (empty spaces etc, p. 20), /dead link/
Kd-tree:
# Jim Hurley, Alexander Kapustin, Alexander Reshetov, Alexei Soupikov, [LINK http://www.graphicon.ru/2002/pdf/Hurley_Kapustin_Reshetov_Soupikov_Re.pdf "Fast ray tracing for modern general purpose cpu"]
Can't remember what it was about.
#Havran, [LINK http://www.mpi-sb.mpg.de/~havran/ARTICLES/eg2000.pdf]
Longest common traversal sequences.
# Wald, [LINK http://graphics.cs.uni-sb.de/Publications/webgen///EGStar03/download//star03.pdf]
Some interesting tidbits, 2003.
Realtimeness:
# [LINK http://www.openrt.de/Siggraph05/UpdatedCourseNotes/course.php "Siggraph 2005 Course on Realtime Ray Tracing"]
Optimizations:
# Christer Ericson, [LINK http://www.research.scea.com/research/pdfs/GDC2003_Memory_Optimization_18Mar03.pdf]
# AMD, [LINK http://www.amd.com/us-en/assets/content_type/white_papers_and_tech_docs/25112.PDF]
Has some SSE latency numbers in an annex.
# Apple, [LINK http://developer.apple.com/hardware/ve/sse.html "SSE Performance Programming"]
Quite recent, but handy nonetheless.
Data sets:
# [LINK http://www.acm.org/tog/resources/SPD/ Standard Procedural Databases]
Nothing but headaches.
MLRTA, by Reshetov et al:
# [LINK ftp://download.intel.com/technology/computing/applications/download/mlrta.pdf]
As Jacco, purposedly, forgot to link it.
... continued.