Hidden Surface Removal Using BSP Tree with CUDA
Department of Computer Engineering, Karabuk University, Karabuk, 78050, Turkey
AWERProcedia Information Technology and Computer Science, Vol 3, 2013
@article{uysal2013hidden,
title={Hidden Surface Removal Using BSP Tree with CUDA},
author={Uysal, Murat and Sen, Baha and Celik, Canan},
journal={AWERProcedia Information Technology and Computer Science},
volume={3},
year={2013}
}
Binary Space Partitioning (BSP) Tree can be used for hidden surface removal. In order to hide invisible surfaces, all surfaces are sorted back to front or front to back order. Traversal of BSP Trees for back to front order of faces requires calculation for all BSP Tree nodes, which can be made in parallel manner. NVIDIA’s CUDA (Compute Unified Device Architecture) is a parallel programming model for GPUs, which shows performance over CPUs for massively parallel computations. Using BSP Tree, rendering of faces sorted by CUDA is implemented and rendering times are compared with the ones observed for the case that CUDA is not used.
July 12, 2013 by hgpu
