About: Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures

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

About: Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures 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://www.sccg.sk/
Description	We present a performance comparison of bounding volume hierarchies and kd-trees for ray tracing on many-core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for maximum performance of tracing rays irrespective of the time needed for their build. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd-trees for simple and moderately complex scenes. Kd-trees, on the other hand, have higher performance for complex scenes, in particular for those with occlusion. We present a performance comparison of bounding volume hierarchies and kd-trees for ray tracing on many-core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for maximum performance of tracing rays irrespective of the time needed for their build. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd-trees for simple and moderately complex scenes. Kd-trees, on the other hand, have higher performance for complex scenes, in particular for those with occlusion. (en)
Title	Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures (en)
skos:prefLabel	Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures Bounding Volume Hierarchies versus Kd-trees on Contemporary Many-Core Architectures (en)
skos:notation	RIV/68407700:21230/14:00221404!RIV15-MSM-21230___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GAP202/12/2413), S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Bittner, Jiří 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	5729
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/14:00221404
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	ray tracing; data structuress; bounding volume hierarchies; kd-trees (en)
http://linked.open.../riv/klicoveSlovo	kd-trees ray tracing bounding volume hierarchies data structuress
http://linked.open...ontrolniKodProRIV	[EBF5C470803C]
http://linked.open...v/mistoKonaniAkce	Smolenice
http://linked.open...i/riv/mistoVydani	Bratislava
http://linked.open...i/riv/nazevZdroje	30th Spring conference on Computer 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	Optimal Algorithms for Image Synthesis
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Bittner, Jiří Havran, Vlastimil Vinkler, Marek
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-05-28 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Univerzita Komenského v Bratislave
https://schema.org/isbn	978-80-223-3601-7
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