Current Proceedings on Technology

Current Proceedings on Technology

Hidden Surface Removal Using BSP Tree with CUDA

Yazarlar: Murat Uysal, Baha Sen, Canan Celik

Cilt 3 , Sayı - , 2013 , Sayfalar -

Konular:-

Anahtar Kelimeler:BSP Tree,CUDA,Hidden surface removal

Özet: 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.

ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2013, title={Hidden Surface Removal Using BSP Tree with CUDA}, volume={3}, number={0}, publisher={Current Proceedings on Technology }, author={Murat Uysal, Baha Sen, Canan Celik}, year={2013} }
APA
KOPYALA
Murat Uysal, Baha Sen, Canan Celik. (2013). Hidden Surface Removal Using BSP Tree with CUDA (Vol. 3). Vol. 3. Current Proceedings on Technology .
MLA
KOPYALA
Murat Uysal, Baha Sen, Canan Celik. Hidden Surface Removal Using BSP Tree with CUDA. no. 0, Current Proceedings on Technology , 2013.
Atıf Görüntüle
PDF Görüntüle
Kaynak Görüntüle
Paylaş
Dergi Bilgileri