|
To appear in the Proceedings of Graphics Interface 2006
|
|
| Nathan A. Carr Adobe Corp |
Jared Hoberock, Keenan Crane, John C. Hart University of Illinois, Urbana-Champaign |
|
Abstract: Using the GPU to accelerate ray tracing may seem like a natural choice due to the highly parallel nature of the problem. However, determining the most versatile GPU data structure for scene storage and traversal is a challenge. In this paper, we introduce a new method for quick intersection of triangular meshes on the GPU. The method uses a threaded bounding volume hierarchy built from a geometry image, which can be efficiently traversed and constructed entirely on the GPU. This acceleration scheme is highly competitive with other GPU ray tracing methods, while allowing for both dynamic geometry and an efficient level of detail scheme at no extra cost.
PDF: geomrt2006.pdf
| |
