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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F11%3A00174010%21RIV12-MSM-21230___
rdf:type
n16:Vysledek skos:Concept
rdfs:seeAlso
http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2010.01844.x/abstract
dcterms:description
In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbor-links have different limitations, which led to several new developments within the last decade. We describe algorithms exploiting ray coherence and algorithms designed with specific hardware architecture limitations such as memory latency and consumption in mind. We also discuss the robustness of traversal algorithms as one issue that has been neglected in previous research. In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbor-links have different limitations, which led to several new developments within the last decade. We describe algorithms exploiting ray coherence and algorithms designed with specific hardware architecture limitations such as memory latency and consumption in mind. We also discuss the robustness of traversal algorithms as one issue that has been neglected in previous research.
dcterms:title
Review: Kd-tree Traversal Algorithms for Ray Tracing Review: Kd-tree Traversal Algorithms for Ray Tracing
skos:prefLabel
Review: Kd-tree Traversal Algorithms for Ray Tracing Review: Kd-tree Traversal Algorithms for Ray Tracing
skos:notation
RIV/68407700:21230/11:00174010!RIV12-MSM-21230___
n16:predkladatel
n17:orjk%3A21230
n3:aktivita
n11:S n11:P n11:Z
n3:aktivity
P(GAP202/11/1883), P(LC06008), P(MEB060906), S, Z(MSM6840770014)
n3:cisloPeriodika
1
n3:dodaniDat
n20:2012
n3:domaciTvurceVysledku
n13:5704847 n13:5692741
n3:druhVysledku
n14:J
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
226912
n3:idVysledku
RIV/68407700:21230/11:00174010
n3:jazykVysledku
n4:eng
n3:klicovaSlova
ray tracing; kd-trees
n3:klicoveSlovo
n6:ray%20tracing n6:kd-trees
n3:kodStatuVydavatele
GB - Spojené království Velké Británie a Severního Irska
n3:kontrolniKodProRIV
[8D07AF6949F7]
n3:nazevZdroje
Computer Graphics Forum
n3:obor
n22:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n5:LC06008 n5:MEB060906 n5:GAP202%2F11%2F1883
n3:rokUplatneniVysledku
n20:2011
n3:svazekPeriodika
30
n3:tvurceVysledku
Hapala, Michal Havran, Vlastimil
n3:wos
000287701100015
n3:zamer
n21:MSM6840770014
s:issn
0167-7055
s:numberOfPages
15
n7:doi
10.1111/j.1467-8659.2010.01844.x
n8:organizacniJednotka
21230