About: Efficient Stack-less BVH Traversal for Ray Tracing

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

About: Efficient Stack-less BVH Traversal for Ray Tracing 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
rdfs:seeAlso	http://dl.acm.org/citation.cfm?id=2461219
Description	We propose a new, completely iterative traversal algorithm for ray tracing bounding volume hierarchies that is based on storing a parent pointer with each node, and on using simple state logic to infer which node to traverse next. Though our traversal algorithm does re-visit internal nodes, it intersects each visited node only once, and in general performs exactly the same ray-box tests and ray-primitive intersection tests---and in exactly the same order---as a traditional stack-based variant. The proposed algorithm can be used for computer architectures that need to minimize the use of local memory for processing rays or those that need to minimize the data transport such as distributed multi-CPU architectures. We propose a new, completely iterative traversal algorithm for ray tracing bounding volume hierarchies that is based on storing a parent pointer with each node, and on using simple state logic to infer which node to traverse next. Though our traversal algorithm does re-visit internal nodes, it intersects each visited node only once, and in general performs exactly the same ray-box tests and ray-primitive intersection tests---and in exactly the same order---as a traditional stack-based variant. The proposed algorithm can be used for computer architectures that need to minimize the use of local memory for processing rays or those that need to minimize the data transport such as distributed multi-CPU architectures. (en)
Title	Efficient Stack-less BVH Traversal for Ray Tracing Efficient Stack-less BVH Traversal for Ray Tracing (en)
skos:prefLabel	Efficient Stack-less BVH Traversal for Ray Tracing Efficient Stack-less BVH Traversal for Ray Tracing (en)
skos:notation	RIV/68407700:21230/13:00214813!RIV14-MSM-21230___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GAP202/11/1883), S, Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Hapala, Michal Havran, Vlastimil
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	72092
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00214813
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	bounding volume hierarchy; ray tracing; stack-based; stack-less traversal algorithm (en)
http://linked.open.../riv/klicoveSlovo	stack-based stack-less traversal algorithm bounding volume hierarchy ray tracing
http://linked.open...ontrolniKodProRIV	[7C2D6D4C344E]
http://linked.open...v/mistoKonaniAkce	Viničné
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	Proceedings of the 27th Spring Conference on Computer Graphics
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Global Illumination for Augmented Reality in General Environments
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Hapala, Michal Havran, Vlastimil Slusallek, P. Wald, I. Davidovič, Tomáš
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-04-28 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
number of pages	6 (xsd:int)
http://bibframe.org/vocab/doi	10.1145/2461217.2461219
http://purl.org/ne...btex#hasPublisher	ACM
https://schema.org/isbn	978-1-4503-1978-2
http://localhost/t...ganizacniJednotka	21230

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, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software