Thesis Details

Budování akceleračních struktur na GPU

Bachelor's Thesis Student: Hába Jiří Academic Year: 2019/2020 Supervisor: Starka Tomáš, Ing.
English title
Acceleration Structure Building on GPU
Language
Czech
Abstract

This thesis focuses on the construction of octree for three-dimensional triangular models on graphics hardware. This acceleration structure was chosen based on a comparison of the most commonly used acceleration structures. The approach to the construction of this structure is based on the method of construction of a sparse voxel octree which is derived from the former. The process uses voxelization accelerated by the graphics card's rendering pipeline. To facilitate this process and enable the integration of the proposed procedure into future applications, this thesis also includes design of a C++ language library.

Keywords

acceleration structure, octree, sparse voxel octree, voxelization, GPU, OpenGL, library

Department
Department of Computer Graphics and Multimedia FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade B
Date
8 July 2020
Reviewer
Kula Michal, Ing., Ph.D.
Committee
Herout Adam, prof. Ing., Ph.D. (DCGM FIT BUT), předseda
Kočí Radek, Ing., Ph.D. (DITS FIT BUT), člen
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT), člen
Španěl Michal, Ing., Ph.D. (DCGM FIT BUT), člen
Vašíček Zdeněk, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Citation
HÁBA, Jiří. Budování akceleračních struktur na GPU. Brno, 2020. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2020-07-08. Supervised by Starka Tomáš. Available from: https://www.fit.vut.cz/study/thesis/22929/
BibTeX 
@bachelorsthesis{FITBT22929,
    author = "Ji\v{r}\'{i} H\'{a}ba",
    type = "Bachelor's thesis",
    title = "Budov\'{a}n\'{i} akcelera\v{c}n\'{i}ch struktur na GPU",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2020,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/22929/"
}

Theses

Back to top