Visibility Driven BVH Build Up Algorithm for Ray Tracing
The result's identifiers
Result code in 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>
Alternative codes found
RIV/00216224:14330/12:00057320
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Visibility Driven BVH Build Up Algorithm for Ray Tracing
Original language description
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
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
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
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Computers & Graphics
ISSN
0097-8493
e-ISSN
—
Volume of the periodical
36
Issue of the periodical within the volume
4
Country of publishing house
GB - UNITED KINGDOM
Number of pages
14
Pages from-to
283-296
UT code for WoS article
000303695300010
EID of the result in the Scopus database
—