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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F13%3A00214813%21RIV14-MSM-21230___
rdf:type
n18:Vysledek skos:Concept
rdfs:seeAlso
http://dl.acm.org/citation.cfm?id=2461219
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 BVH Traversal for Ray Tracing Efficient Stack-less BVH Traversal for Ray Tracing
skos:prefLabel
Efficient Stack-less BVH Traversal for Ray Tracing Efficient Stack-less BVH Traversal for Ray Tracing
skos:notation
RIV/68407700:21230/13:00214813!RIV14-MSM-21230___
n18:predkladatel
n21:orjk%3A21230
n4:aktivita
n6:Z n6:S n6:P
n4:aktivity
P(GAP202/11/1883), S, Z(MSM6840770014)
n4:dodaniDat
n5:2014
n4:domaciTvurceVysledku
n19:5704847 n19:5692741
n4:druhVysledku
n15:D
n4:duvernostUdaju
n23:S
n4:entitaPredkladatele
n22:predkladatel
n4:idSjednocenehoVysledku
72092
n4:idVysledku
RIV/68407700:21230/13:00214813
n4:jazykVysledku
n14:eng
n4:klicovaSlova
bounding volume hierarchy; ray tracing; stack-based; stack-less traversal algorithm
n4:klicoveSlovo
n10:ray%20tracing n10:stack-based n10:stack-less%20traversal%20algorithm n10:bounding%20volume%20hierarchy
n4:kontrolniKodProRIV
[7C2D6D4C344E]
n4:mistoKonaniAkce
Viničné
n4:mistoVydani
New York
n4:nazevZdroje
Proceedings of the 27th Spring Conference on Computer Graphics
n4:obor
n9:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
5
n4:projekt
n25:GAP202%2F11%2F1883
n4:rokUplatneniVysledku
n5:2013
n4:tvurceVysledku
Davidovič, Tomáš Wald, I. Slusallek, P. Havran, Vlastimil Hapala, Michal
n4:typAkce
n17:WRD
n4:zahajeniAkce
2011-04-28+02:00
n4:zamer
n24:MSM6840770014
s:numberOfPages
6
n12:doi
10.1145/2461217.2461219
n20:hasPublisher
ACM
n8:isbn
978-1-4503-1978-2
n3:organizacniJednotka
21230