About: Stackless Ray Traversal for kD-Trees with Sparse Boxes

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Stackless Ray Traversal for kD-Trees with Sparse Boxes Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en) 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. (cs)
Title	Stackless Ray Traversal for kD-Trees with Sparse Boxes Stackless Ray Traversal for kD-Trees with Sparse Boxes (en) Stackless Ray Traversal for kD-Trees with Sparse Boxes (cs)
skos:prefLabel	Stackless Ray Traversal for kD-Trees with Sparse Boxes Stackless Ray Traversal for kD-Trees with Sparse Boxes (en) Stackless Ray Traversal for kD-Trees with Sparse Boxes (cs)
skos:notation	RIV/68407700:21230/07:03138105!RIV08-MSM-21230___
http://linked.open.../vavai/riv/strany	16;30
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(LC06008)
http://linked.open...iv/cisloPeriodika	3
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Bittner, Jiří Havran, Vlastimil
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	452003
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/07:03138105
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	kd trees; sparse boxes (en)
http://linked.open.../riv/klicoveSlovo	kd trees sparse boxes
http://linked.open...odStatuVydavatele	RU - Ruská federace
http://linked.open...ontrolniKodProRIV	[38ABA2B4C49C]
http://linked.open...i/riv/nazevZdroje	Computer Graphics & Geometry
http://linked.open...in/vavai/riv/obor	CH
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of Computer Graphics
http://linked.open...UplatneniVysledku	2007
http://linked.open...v/svazekPeriodika	9
http://linked.open...iv/tvurceVysledku	Bittner, Jiří Havran, Vlastimil
issn	1811-8992
number of pages	1514 (xsd:int)
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	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

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 92 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software