Visibility Driven BVH Build Up Algorithm for Ray Tracing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00193497" target="_blank" >RIV/68407700:21230/12:00193497 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216224:14330/12:00057320

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.cag.2012.02.013" target="_blank" >http://dx.doi.org/10.1016/j.cag.2012.02.013</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.cag.2012.02.013" target="_blank" >10.1016/j.cag.2012.02.013</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Visibility Driven BVH Build Up Algorithm for Ray Tracing

Popis výsledku v původním jazyce

The minimization of traversal cost using surface area heuristic is extensively used to build high quality spatial subdivisions and bounding volume hierarchies for ray tracing. Despite the fair performance of trees built with the cost model, it is known that the underlying assumptions for surface area heuristics are not realistic. In this paper we show how the cost function of the surface area heuristic can be improved on using the assumed visibility of geometric primitives such as triangles. This way the build algorithm utilizes the exact or assumed visibility to construct more efficient BVHs by traversing smaller portion of the hierarchy. We show that by these inexpensive modifications to the cost function we can speed up the ray traversal by approximately 102% on average for path tracing of highly occluded scenes compared to standard surface area heuristics. Moreover, it is also possible to lower the construction time and memory usage by subdividing only those parts of the animated s

Název v anglickém jazyce

Visibility Driven BVH Build Up Algorithm for Ray Tracing

Popis výsledku anglicky

The minimization of traversal cost using surface area heuristic is extensively used to build high quality spatial subdivisions and bounding volume hierarchies for ray tracing. Despite the fair performance of trees built with the cost model, it is known that the underlying assumptions for surface area heuristics are not realistic. In this paper we show how the cost function of the surface area heuristic can be improved on using the assumed visibility of geometric primitives such as triangles. This way the build algorithm utilizes the exact or assumed visibility to construct more efficient BVHs by traversing smaller portion of the hierarchy. We show that by these inexpensive modifications to the cost function we can speed up the ray traversal by approximately 102% on average for path tracing of highly occluded scenes compared to standard surface area heuristics. Moreover, it is also possible to lower the construction time and memory usage by subdividing only those parts of the animated s

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computers & Graphics

ISSN

0097-8493

e-ISSN

—

Svazek periodika

36

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

14

Strana od-do

283-296

Kód UT WoS článku

000303695300010

EID výsledku v databázi Scopus

—