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

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

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://purl.org/net/nknouf/ns/bibtex#
n12http://localhost/temp/predkladatel/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F14%3A00221404%21RIV15-MSM-21230___/
n20https://schema.org/
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#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F14%3A00221404%21RIV15-MSM-21230___
rdf:type
skos:Concept n9:Vysledek
rdfs:seeAlso
http://www.sccg.sk/
dcterms:description
We present a performance comparison of bounding volume hierarchies and kd-trees for ray tracing on many-core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for maximum performance of tracing rays irrespective of the time needed for their build. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd-trees for simple and moderately complex scenes. Kd-trees, on the other hand, have higher performance for complex scenes, in particular for those with occlusion. We present a performance comparison of bounding volume hierarchies and kd-trees for ray tracing on many-core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for maximum performance of tracing rays irrespective of the time needed for their build. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd-trees for simple and moderately complex scenes. Kd-trees, on the other hand, have higher performance for complex scenes, in particular for those with occlusion.
dcterms:title
Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures
skos:prefLabel
Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures
skos:notation
RIV/68407700:21230/14:00221404!RIV15-MSM-21230___
n3:aktivita
n11:S n11:P
n3:aktivity
P(GAP202/12/2413), S
n3:dodaniDat
n17:2015
n3:domaciTvurceVysledku
n4:5704847 n4:1257072
n3:druhVysledku
n16:D
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
5729
n3:idVysledku
RIV/68407700:21230/14:00221404
n3:jazykVysledku
n14:eng
n3:klicovaSlova
ray tracing; data structuress; bounding volume hierarchies; kd-trees
n3:klicoveSlovo
n5:data%20structuress n5:ray%20tracing n5:bounding%20volume%20hierarchies n5:kd-trees
n3:kontrolniKodProRIV
[EBF5C470803C]
n3:mistoKonaniAkce
Smolenice
n3:mistoVydani
Bratislava
n3:nazevZdroje
30th Spring conference on Computer Graphics
n3:obor
n19:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n6:GAP202%2F12%2F2413
n3:rokUplatneniVysledku
n17:2014
n3:tvurceVysledku
Vinkler, Marek Havran, Vlastimil Bittner, Jiří
n3:typAkce
n15:WRD
n3:zahajeniAkce
2014-05-28+02:00
s:numberOfPages
8
n21:hasPublisher
Univerzita Komenského v Bratislave
n20:isbn
978-80-223-3601-7
n12:organizacniJednotka
21230