About: When It Makes Sense to Use Uniform Grids for Ray Tracing

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

About: When It Makes Sense to Use Uniform Grids 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://wscg.zcu.cz/WSCG2011/!_2011_WSCG-Short_Papers.pdf
Description	Commonly used hierarchical data structures such as bounding volume hierarchies and kd-trees have rather high build times, which can be a bottleneck for applications rebuilding or updating the acceleration structure required by data changes. On the other hand uniform grids can be built almost instantly in linear time, however, they can suffer from severe performance penalty, in particular in scenes with non-uniformly populated geometry. We improve on performance using a two-step approach that combines both approaches: first we build a uniform grid and test its performance. Second, using an estimate on the number of rays to be queried we either continue using the grid or build a hierarchical data structure instead. This way we select a more efficient data structure given a particular implementation of the algorithms which yields with high probability an overall smaller computational time. We evaluate the properties of this method for a set of 28 scenes. Commonly used hierarchical data structures such as bounding volume hierarchies and kd-trees have rather high build times, which can be a bottleneck for applications rebuilding or updating the acceleration structure required by data changes. On the other hand uniform grids can be built almost instantly in linear time, however, they can suffer from severe performance penalty, in particular in scenes with non-uniformly populated geometry. We improve on performance using a two-step approach that combines both approaches: first we build a uniform grid and test its performance. Second, using an estimate on the number of rays to be queried we either continue using the grid or build a hierarchical data structure instead. This way we select a more efficient data structure given a particular implementation of the algorithms which yields with high probability an overall smaller computational time. We evaluate the properties of this method for a set of 28 scenes. (en)
Title	When It Makes Sense to Use Uniform Grids for Ray Tracing When It Makes Sense to Use Uniform Grids for Ray Tracing (en)
skos:prefLabel	When It Makes Sense to Use Uniform Grids for Ray Tracing When It Makes Sense to Use Uniform Grids for Ray Tracing (en)
skos:notation	RIV/68407700:21230/11:00174019!RIV12-MSM-21230___
http://linked.open...avai/predkladatel	Fakulta elektrotechnická
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GAP202/11/1883), P(LC06008), P(MEB060906), S, Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Hapala, Michal Havran, Vlastimil Karlík, Ondřej
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	241729
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/11:00174019
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	ray tracing, ray casting, uniform grid, kd-tree, hierarchical data structures (en)
http://linked.open.../riv/klicoveSlovo	hierarchical data structures kd-tree ray casting uniform grid ray tracing
http://linked.open...ontrolniKodProRIV	[0A9D2D287094]
http://linked.open...v/mistoKonaniAkce	Plzeň
http://linked.open...i/riv/mistoVydani	Plzeň
http://linked.open...i/riv/nazevZdroje	WSCG'2011 - 19-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2011, Communication Papers
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Global Illumination for Augmented Reality in General Environments Center of Computer Graphics General Purpose Visibility
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Hapala, Michal Havran, Vlastimil Karlík, Ondřej
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2011-01-31 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	UNION Agency - Science Press
https://schema.org/isbn	978-80-86943-82-4
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	When It Makes Sense to Use Uniform Grids for Ray Tracing When It Makes Sense to Use Uniform Grids for Ray Tracing

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