<?xml version="1.0" encoding="utf-8"?>
<!-- generator="FeedCreator 1.7.2-ppt DokuWiki" -->
<?xml-stylesheet href="http://www.davidovic.cz/wiki/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="http://www.davidovic.cz/wiki/feed.php">
        <title>Tomas Davidovic's Homepage school:hapala_sccg2011</title>
        <description></description>
        <link>http://www.davidovic.cz/wiki/</link>
        <image rdf:resource="http://www.davidovic.cz/wiki/lib/tpl/arctic/images/favicon.ico" />
       <dc:date>2026-04-30T04:23:53+02:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="http://www.davidovic.cz/wiki/doku.php/school/hapala_sccg2011/hapala_sccg2011?rev=1313110382&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="http://www.davidovic.cz/wiki/lib/tpl/arctic/images/favicon.ico">
        <title>Tomas Davidovic's Homepage</title>
        <link>http://www.davidovic.cz/wiki/</link>
        <url>http://www.davidovic.cz/wiki/lib/tpl/arctic/images/favicon.ico</url>
    </image>
    <item rdf:about="http://www.davidovic.cz/wiki/doku.php/school/hapala_sccg2011/hapala_sccg2011?rev=1313110382&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2011-08-12T02:53:02+02:00</dc:date>
        <title>Efficient Stack-less BVH Traversal for Ray Tracing</title>
        <link>http://www.davidovic.cz/wiki/doku.php/school/hapala_sccg2011/hapala_sccg2011?rev=1313110382&amp;do=diff</link>
        <description>M. Hapala, T. Davidovic, I. Wald, V. Havran, and P. Slusallek


Proceedings of [27th Spring conference on Computer Graphics]


[Conference]
[Fairy forest]
[Sibenik Cathedral]

[[bib]][[paper]]

Abstract:   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…</description>
    </item>
</rdf:RDF>
