This HTML5 document contains 42 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/
n6http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F07%3A03138105%21RIV08-MSM-21230___/
n16http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F07%3A03138105%21RIV08-MSM-21230___
rdf:type
skos:Concept n16:Vysledek
dcterms:description
We present a new stackless ray traversal algorithm which makes use of kD-tree augmented with sparsely distributed bounding boxes. The proposed traversal algorithm is not restricted to start the hierarchy traversal at the root node and so it can exploit the knowledge of the ray origin. The algorithm achieves traversal times comparable with the traditional hierarchical traversal as well as recently introduced bottom-up traversal with sparse boxes. The stackless nature of the algorithm lends itself towards implementation of the method on the architectures with limited number of registers. We present a new stackless ray traversal algorithm which makes use of kD-tree augmented with sparsely distributed bounding boxes. The proposed traversal algorithm is not restricted to start the hierarchy traversal at the root node and so it can exploit the knowledge of the ray origin. The algorithm achieves traversal times comparable with the traditional hierarchical traversal as well as recently introduced bottom-up traversal with sparse boxes. The stackless nature of the algorithm lends itself towards implementation of the method on the architectures with limited number of registers. We present a new stackless ray traversal algorithm which makes use of kD-tree augmented with sparsely distributed bounding boxes. The proposed traversal algorithm is not restricted to start the hierarchy traversal at the root node and so it can exploit the knowledge of the ray origin. The algorithm achieves traversal times comparable with the traditional hierarchical traversal as well as recently introduced bottom-up traversal with sparse boxes. The stackless nature of the algorithm lends itself towards implementation of the method on the architectures with limited number of registers.
dcterms:title
Stackless Ray Traversal for kD-Trees with Sparse Boxes Stackless Ray Traversal for kD-Trees with Sparse Boxes Stackless Ray Traversal for kD-Trees with Sparse Boxes
skos:prefLabel
Stackless Ray Traversal for kD-Trees with Sparse Boxes Stackless Ray Traversal for kD-Trees with Sparse Boxes Stackless Ray Traversal for kD-Trees with Sparse Boxes
skos:notation
RIV/68407700:21230/07:03138105!RIV08-MSM-21230___
n4:strany
16;30
n4:aktivita
n15:P
n4:aktivity
P(LC06008)
n4:cisloPeriodika
3
n4:dodaniDat
n14:2008
n4:domaciTvurceVysledku
n5:5704847 n5:1257072
n4:druhVysledku
n18:J
n4:duvernostUdaju
n13:S
n4:entitaPredkladatele
n12:predkladatel
n4:idSjednocenehoVysledku
452003
n4:idVysledku
RIV/68407700:21230/07:03138105
n4:jazykVysledku
n17:eng
n4:klicovaSlova
kd trees; sparse boxes
n4:klicoveSlovo
n8:kd%20trees n8:sparse%20boxes
n4:kodStatuVydavatele
RU - Ruská federace
n4:kontrolniKodProRIV
[38ABA2B4C49C]
n4:nazevZdroje
Computer Graphics & Geometry
n4:obor
n10:CH
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:projekt
n11:LC06008
n4:rokUplatneniVysledku
n14:2007
n4:svazekPeriodika
9
n4:tvurceVysledku
Havran, Vlastimil Bittner, Jiří
s:issn
1811-8992
s:numberOfPages
1514
n6:organizacniJednotka
21230