This HTML5 document contains 39 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/
n5http://localhost/temp/predkladatel/
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n12http://linked.opendata.cz/ontology/domain/vavai/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n4http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F11%3A00180561%21RIV13-MSM-21230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F11%3A00180561%21RIV13-MSM-21230___
rdf:type
n12:Vysledek skos:Concept
rdfs:seeAlso
https://www.sgs.cvut.cz/index.php?action=workshop_2011
dcterms:description
Commonly used hierarchical data structures such as bounding volume hierarchies and kdtrees have rather high build times, which can be a bottleneck for applications rebuilding or updating the acceleration structure required by data changes. On the other hand uniform grids can be built almost instantly in linear time, however, they can suffer from severe performance penalty, in particular in scenes with non uniformly populated geometry. We improve on performance using a two-step approach that selects a more efficient data structure given a particular implementation of the algorithms which yields with high probability an overall smaller computational time. Commonly used hierarchical data structures such as bounding volume hierarchies and kdtrees have rather high build times, which can be a bottleneck for applications rebuilding or updating the acceleration structure required by data changes. On the other hand uniform grids can be built almost instantly in linear time, however, they can suffer from severe performance penalty, in particular in scenes with non uniformly populated geometry. We improve on performance using a two-step approach that selects a more efficient data structure given a particular implementation of the algorithms which yields with high probability an overall smaller computational time.
dcterms:title
When it is More Efficient to Use Uniform Grids for Ray Tracing When it is More Efficient to Use Uniform Grids for Ray Tracing
skos:prefLabel
When it is More Efficient to Use Uniform Grids for Ray Tracing When it is More Efficient to Use Uniform Grids for Ray Tracing
skos:notation
RIV/68407700:21230/11:00180561!RIV13-MSM-21230___
n12:predkladatel
n19:orjk%3A21230
n3:aktivita
n16:S n16:P
n3:aktivity
P(GAP202/11/1883), P(MEB060906), S
n3:dodaniDat
n8:2013
n3:domaciTvurceVysledku
n13:4235320 n13:5704847 n13:5692741
n3:druhVysledku
n17:O
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n4:predkladatel
n3:idSjednocenehoVysledku
241728
n3:idVysledku
RIV/68407700:21230/11:00180561
n3:jazykVysledku
n15:eng
n3:klicovaSlova
Ray tracing; uniform grids; hierarchical data structure
n3:klicoveSlovo
n9:Ray%20tracing n9:uniform%20grids n9:hierarchical%20data%20structure
n3:kontrolniKodProRIV
[5322AF27F8D4]
n3:obor
n10:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n11:GAP202%2F11%2F1883 n11:MEB060906
n3:rokUplatneniVysledku
n8:2011
n3:tvurceVysledku
Hapala, Michal Karlík, Ondřej Havran, Vlastimil
n5:organizacniJednotka
21230