This HTML5 document contains 53 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n22http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n24http://localhost/temp/predkladatel/
n14http://purl.org/net/nknouf/ns/bibtex#
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F11%3A00180801%21RIV12-MSM-21230___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n23http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F11%3A00180801%21RIV12-MSM-21230___
rdf:type
n7:Vysledek skos:Concept
rdfs:seeAlso
http://dcgi.felk.cvut.cz/home/havran/ARTICLES/sccg2011.pdf
dcterms: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. 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.
dcterms:title
Efficient Stack-less Traversal Algorithm for Ray Tracing with BVH Efficient Stack-less Traversal Algorithm for Ray Tracing with BVH
skos:prefLabel
Efficient Stack-less Traversal Algorithm for Ray Tracing with BVH Efficient Stack-less Traversal Algorithm for Ray Tracing with BVH
skos:notation
RIV/68407700:21230/11:00180801!RIV12-MSM-21230___
n7:predkladatel
n8:orjk%3A21230
n3:aktivita
n5:Z n5:S n5:P
n3:aktivity
P(GAP202/11/1883), P(LC06008), P(MEB060906), S, Z(MSM6840770014)
n3:dodaniDat
n9:2012
n3:domaciTvurceVysledku
n18:5704847 n18:5692741
n3:druhVysledku
n15:D
n3:duvernostUdaju
n23:S
n3:entitaPredkladatele
n21:predkladatel
n3:idSjednocenehoVysledku
196764
n3:idVysledku
RIV/68407700:21230/11:00180801
n3:jazykVysledku
n11:eng
n3:klicovaSlova
ray tracing, ray traversal, bounding volume hierarchy, BVH, stack-less
n3:klicoveSlovo
n4:bounding%20volume%20hierarchy n4:BVH n4:stack-less n4:ray%20tracing n4:ray%20traversal
n3:kontrolniKodProRIV
[3D7E2F4437B0]
n3:mistoKonaniAkce
Vinicne
n3:mistoVydani
Bratislava
n3:nazevZdroje
SCCG 2011 - 27th Spring conference on Computer Graphics
n3:obor
n10:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
5
n3:projekt
n6:GAP202%2F11%2F1883 n6:LC06008 n6:MEB060906
n3:rokUplatneniVysledku
n9:2011
n3:tvurceVysledku
Slusallek, P. Davidovic, T. Hapala, Michal Wald, I. Havran, Vlastimil
n3:typAkce
n22:WRD
n3:zahajeniAkce
2011-04-28+02:00
n3:zamer
n12:MSM6840770014
s:numberOfPages
6
n14:hasPublisher
Univerzita Komenského v Bratislave
n20:isbn
978-80-223-3018-3
n24:organizacniJednotka
21230