About: Visibility driven BVH build up algorithm for ray tracing

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

About: Visibility driven BVH build up algorithm for ray tracing Goto Sponge Distinct 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	The minimization of traversal cost using surface area heuristic is extensively used to build high quality spatial subdivisions and bounding volume hierarchies for ray tracing. Despite the fair performance of trees built with the cost model, it is known that the underlying assumptions for surface area heuristics are not realistic. In this paper we show how the cost function of the surface area heuristic can be improved on using the assumed visibility of geometric primitives such as triangles. This way the build algorithm utilizes the exact or assumed visibility to construct more efficient BVHs by traversing smaller portion of the hierarchy. We show that by these inexpensive modifications to the cost function we can speed up the ray traversal by approximately 102% on average for path tracing of highly occluded scenes compared to standard surface area heuristics. The minimization of traversal cost using surface area heuristic is extensively used to build high quality spatial subdivisions and bounding volume hierarchies for ray tracing. Despite the fair performance of trees built with the cost model, it is known that the underlying assumptions for surface area heuristics are not realistic. In this paper we show how the cost function of the surface area heuristic can be improved on using the assumed visibility of geometric primitives such as triangles. This way the build algorithm utilizes the exact or assumed visibility to construct more efficient BVHs by traversing smaller portion of the hierarchy. We show that by these inexpensive modifications to the cost function we can speed up the ray traversal by approximately 102% on average for path tracing of highly occluded scenes compared to standard surface area heuristics. (en)
Title	Visibility driven BVH build up algorithm for ray tracing Visibility driven BVH build up algorithm for ray tracing (en)
skos:prefLabel	Visibility driven BVH build up algorithm for ray tracing Visibility driven BVH build up algorithm for ray tracing (en)
skos:notation	RIV/00216224:14330/12:00057320!RIV13-GA0-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GAP202/10/1435), P(GAP202/11/1883), P(GAP202/12/2413), P(LC06008), S, Z(MSM6840770014)
http://linked.open...iv/cisloPeriodika	4
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Sochor, Jiří Vinkler, Marek
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	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	177552
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/12:00057320
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Ray tracing; Bounding volume hierarchies; BVH build algorithm; Surface area heuristic (en)
http://linked.open.../riv/klicoveSlovo	Ray tracing BVH build algorithm Bounding volume hierarchies Surface area heuristic
http://linked.open...odStatuVydavatele	CZ - Česká republika
http://linked.open...ontrolniKodProRIV	[0091B3017BE7]
http://linked.open...i/riv/nazevZdroje	Computers & Graphics
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Global Illumination for Augmented Reality in General Environments Analysis and Visualization of Protein Structures Center of Computer Graphics Optimal Algorithms for Image Synthesis
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	36
http://linked.open...iv/tvurceVysledku	Sochor, Jiří Havran, Vlastimil Vinkler, Marek
http://linked.open...ain/vavai/riv/wos	000303695300010
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
issn	0097-8493
number of pages	14 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.cag.2012.02.013
http://localhost/t...ganizacniJednotka	14330

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