dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Vangorp, P. | |
dc.contributor.author | Kralingen, Athos van | |
dc.date.accessioned | 2024-02-15T15:07:06Z | |
dc.date.available | 2024-02-15T15:07:06Z | |
dc.date.issued | 2024 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/46026 | |
dc.description.abstract | In this thesis, alternatives to the greedily applied Surface Area Heuristics for BVH construction for ray tracing are explored. Non-greedy evaluation is used for measuring the impact of greedy evaluation methods and other heuristics are evaluated to see the ray tracing impact separately by ray distribution and scene. Greedy construction for random scenes shows linear growth in impact compared to non-greedy construction, but minimal impact for scenes with more structured primitives. Alternatives to the Surface Area Heuristic itself show improved ray tracing performance in given scenes, but on average, SAH still is found to be one of the better alternatives. It is found that if the heuristic can be fitted to the scene, better alternatives to SAH exist. | |
dc.description.sponsorship | Utrecht University | |
dc.language.iso | EN | |
dc.subject | Ray tracing requires intersection tests between high number of rays and primitives. Acceleration structures such as Bounding Volume Hierarchies can be used to reduce these intersection tests. Construction algorithms for Bounding Volume Hierarchies commonly use the Surface Area Heuristic, but this is not always optimal. This thesis explores alternatives. | |
dc.title | Assessing Alternatives to the Surface Area Heuristic for Bounding Volume Hierarchy Construction | |
dc.type.content | Master Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.keywords | BVH; ray tracing; bounding-volume-hierarchy; surface-area-heuristic; SAH; acceleration structures | |
dc.subject.courseuu | Game and Media Technology | |
dc.thesis.id | 23408 | |