Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes
View/ Open
Date
2007Author
Shevtsov, Maxim
Soupikov, Alexei
Kapustin, Alexander
Metadata
Show full item recordAbstract
We present a highly parallel, linearly scalable technique of kd-tree construction for ray tracing of dynamic geometry. We use conventional kd-tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd-tree quality for rendering stage. The algorithm builds a kd-tree from scratch each frame, thus prior knowledge of motion /deformation or motion constraints are not required. We achieve nearly real-time performance of 7-12 FPS for models with 200K of dynamic triangles at 1024x1024 resolution with shadows and textures.
BibTeX
@article {10.1111:j.1467-8659.2007.01062.x,
journal = {Computer Graphics Forum},
title = {{Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes}},
author = {Shevtsov, Maxim and Soupikov, Alexei and Kapustin, Alexander},
year = {2007},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2007.01062.x}
}
journal = {Computer Graphics Forum},
title = {{Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes}},
author = {Shevtsov, Maxim and Soupikov, Alexei and Kapustin, Alexander},
year = {2007},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2007.01062.x}
}