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

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F06%3A00121459%21RIV10-MSM-21230___
rdf:type
skos:Concept n13:Vysledek
dcterms:description
In this paper we address the problem of fast construction of spatial hierarchies for ray tracing with applications in animated environments including non-rigid animations. We discuss properties of currently used techniques with $O(N \log N)$ construction time for kd-trees and bounding volume hierarchies. Further, we propose a hybrid data structure blending between a spatial kd-tree and bounding volume primitives. We keep our novel hierarchical data structures algorithmically efficient and comparable with kd-trees by the use of a cost model based on surface area heuristics. In this paper we address the problem of fast construction of spatial hierarchies for ray tracing with applications in animated environments including non-rigid animations. We discuss properties of currently used techniques with $O(N \log N)$ construction time for kd-trees and bounding volume hierarchies. Further, we propose a hybrid data structure blending between a spatial kd-tree and bounding volume primitives. We keep our novel hierarchical data structures algorithmically efficient and comparable with kd-trees by the use of a cost model based on surface area heuristics.
dcterms:title
On Fast Construction of Spatial Hierarchies for Ray Tracing On Fast Construction of Spatial Hierarchies for Ray Tracing
skos:prefLabel
On Fast Construction of Spatial Hierarchies for Ray Tracing On Fast Construction of Spatial Hierarchies for Ray Tracing
skos:notation
RIV/68407700:21230/06:00121459!RIV10-MSM-21230___
n4:aktivita
n16:P
n4:aktivity
P(LC06008)
n4:dodaniDat
n8:2010
n4:domaciTvurceVysledku
n17:5704847
n4:druhVysledku
n5:O
n4:duvernostUdaju
n9:S
n4:entitaPredkladatele
n12:predkladatel
n4:idSjednocenehoVysledku
490322
n4:idVysledku
RIV/68407700:21230/06:00121459
n4:jazykVysledku
n10:eng
n4:klicovaSlova
spatial kd-tree
n4:klicoveSlovo
n15:spatial%20kd-tree
n4:kontrolniKodProRIV
[10F37612AB14]
n4:obor
n14:JC
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:projekt
n7:LC06008
n4:rokUplatneniVysledku
n8:2006
n4:tvurceVysledku
Havran, Vlastimil
n11:organizacniJednotka
21230