Bounding volume hierarchy-tetrahedralization hybrid acceleration structure for ray tracing

buir.advisorGüdükbay, Uğur
dc.contributor.authorDemirci, Serkan
dc.date.accessioned2020-12-15T11:18:23Z
dc.date.available2020-12-15T11:18:23Z
dc.date.copyright2020-12
dc.date.issued2020-12
dc.date.submitted2020-12-09
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2020.en_US
dc.descriptionIncludes bibliographical references (leaves 45-49).en_US
dc.description.abstractThe computational cost of the ray-tracing method is directly proportional to the number of ray-surface intersection tests. The naive ray-tracing algorithm requires O(N) computational cost for the ray-surface intersection calculations where N is the number of primitives in the scene. Ray tracing acceleration data structures like the regular grid, bounding volume hierarchy (BVH), kd-tree, constrained tetrahedralization, has been developed to reduce the number of rayobject intersection tests to speed-up ray tracing. We propose a hybrid acceleration structure, the Bounding Volume HierarchyTetrahedral mesh hybrid (BTH) acceleration structure, that can be used to speedup ray tracing. BTH structure is composed of a BVH hierarchy where some of the leaves of the BVH hierarchy contain tetrahedralizations. We propose an algorithm for the construction of the BTH structure. We describe methods for approximating the average nearest-hit cost of a tetrahedralization, which we use for the construction of BTH. Besides, we can adapt the proposed BTH structure for dynamic scenes with hierarchical motion. We describe a two-level BVH-BTH acceleration structure for rendering animated scenes. We test the proposed BTH structure using various scenes. For some of the experiments, the BTH structure performs better against other acceleration structures in terms of rendering times. We perform experiments for animated scenes. We show that the two-level BTH structure outperforms the two-level BVH structure for the tested dynamic scenes.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2020-12-15T11:18:23Z No. of bitstreams: 1 10370303.pdf: 44313056 bytes, checksum: 1d9b471c2f5e1ac24ae50f56883bcc11 (MD5)en
dc.description.provenanceMade available in DSpace on 2020-12-15T11:18:23Z (GMT). No. of bitstreams: 1 10370303.pdf: 44313056 bytes, checksum: 1d9b471c2f5e1ac24ae50f56883bcc11 (MD5) Previous issue date: 2020-12en
dc.description.statementofresponsibilityby Serkan Demircien_US
dc.embargo.release2021-06-08
dc.format.extentx, 49 leaves : illustrations , charts ; 30 cm.en_US
dc.identifier.itemidB133667
dc.identifier.urihttp://hdl.handle.net/11693/54842
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectRay tracingen_US
dc.subjectAcceleration structureen_US
dc.subjectTetrahedralizationen_US
dc.subjectBounding volume hierarchyen_US
dc.subjectk-d treeen_US
dc.titleBounding volume hierarchy-tetrahedralization hybrid acceleration structure for ray tracingen_US
dc.title.alternativeIşın izleme için sınırlayıcı hacim hiyerarşisi-dörtyüzleme hibrit hızlandırıcı yapısıen_US
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
10370303.pdf
Size:
42.26 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: