Back to Search
Start Over
An evaluation of Kd-Trees vs Bounding Volume Hierarchy (BVH) acceleration structures in modern CPU architectures
- Source :
- Tecnología en Marcha, Vol 36, Iss 2 (2023)
- Publication Year :
- 2023
- Publisher :
- Instituto Tecnológico de Costa Rica, 2023.
-
Abstract
- Ray tracing is a rendering technique that is highly praised for its realism and image quality. Nonetheless, this is a computationally intensive task that is slow compared to other rendering techniques like rasterization. Bounding Volume Hierarchy (BVH) is a primitive subdivision acceleration mechanism that is the mainly used method for accelerating ray tracing in modern solutions. It is regarded as having better performance against other acceleration methods. Another well-known technique is Kd-Trees that uses binary space partitioning to adaptively subdivide space with planes. In this research, we made an up-to-date evaluation of both acceleration structures, using state-of-the-art BVH and Kd-Trees algorithms implemented in C, and found out that the Kd-Trees acceleration structure provided better performance in all defined scenarios on a modern x86 CPU architecture.
- Subjects :
- ray tracing
CPU
BVH
KD-Trees
acceleration structures
modern hardware
Technology
Subjects
Details
- Language :
- Spanish; Castilian
- ISSN :
- 03793982 and 22153241
- Volume :
- 36
- Issue :
- 2
- Database :
- Directory of Open Access Journals
- Journal :
- Tecnología en Marcha
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.84e9a565fac4b24bcd81f12233be6b0
- Document Type :
- article
- Full Text :
- https://doi.org/10.18845/tm.v36i2.6098