Efficient Stack-less Traversal Algorithm for Ray Tracing with BVH
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00180801" target="_blank" >RIV/68407700:21230/11:00180801 - isvavai.cz</a>
Result on the web
<a href="http://dcgi.felk.cvut.cz/home/havran/ARTICLES/sccg2011.pdf" target="_blank" >http://dcgi.felk.cvut.cz/home/havran/ARTICLES/sccg2011.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Efficient Stack-less Traversal Algorithm for Ray Tracing with BVH
Original language description
We propose a new, completely iterative traversal algorithm for ray tracing bounding volume hierarchies that is based on storing a parent pointer with each node, and on using simple state logic to infer which node to traverse next. Though our traversal algorithm does re-visit internal nodes, it intersects each visited node only once, and in general performs exactly the same ray-box tests and ray-primitive intersection tests---and in exactly the same order---as a traditional stack-based variant. The proposed algorithm can be used for computer architectures that need to minimize the use of local memory for processing rays or those that need to minimize the data transport such as distributed multi-CPU architectures.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
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
2011
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
Article name in the collection
SCCG 2011 - 27th Spring conference on Computer Graphics
ISBN
978-80-223-3018-3
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
29-34
Publisher name
Comenius University
Place of publication
Bratislava
Event location
Vinicne
Event date
Apr 28, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—