Multidimensional binary search trees used for associative searching
Communications of the ACM
Efficiency issues for ray tracing
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Hi-index | 0.00 |
In case of using ray tracing for rendering of massive particles, it usually takes more time than mesh-based models, where the particle data used for the representation of fluid are generated by the fluid simulator. It also has a large amount of particle set with high density. In this paper, we apply two schemes to reduce the rendering time and solve the problems using the characteristics of the particles. We suggest that GPGPU can improve the efficiency of the operations through parallel processing and a modified Kd-tree spatial subdivision algorithm for speed-up.