About: Ray Tracing on a GPU with CUDA - Comparative Study of Three Algorithms

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

About: Ray Tracing on a GPU with CUDA - Comparative Study of Three Algorithms 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 comparative study of ray tracing algorithms implemented on a GPU for three published papers using different spatial data structures evaluated for performance on nine static scenes in walk-through animation. We compare the performance for uniform grids, bounding volume hierarchies (BVHs), and kd-trees evaluated on a GPU for ray casting and Whitted-style ray tracing. We show that performance of ray tracing with BVHs exceeds the performance of ray tracing with kd-trees for coherent rays. Contrary, the ray tracing with kd-trees is faster than that with BVHs for incoherent rays. The performance of ray tracing with uniform grids is slower than both ray tracing with BVHs and kd-trees except for uniformly populated scenes. We show that the performance is highly sensitive to details of implementation on kd-trees. We present a comparative study of ray tracing algorithms implemented on a GPU for three published papers using different spatial data structures evaluated for performance on nine static scenes in walk-through animation. We compare the performance for uniform grids, bounding volume hierarchies (BVHs), and kd-trees evaluated on a GPU for ray casting and Whitted-style ray tracing. We show that performance of ray tracing with BVHs exceeds the performance of ray tracing with kd-trees for coherent rays. Contrary, the ray tracing with kd-trees is faster than that with BVHs for incoherent rays. The performance of ray tracing with uniform grids is slower than both ray tracing with BVHs and kd-trees except for uniformly populated scenes. We show that the performance is highly sensitive to details of implementation on kd-trees. (en)
Title	Ray Tracing on a GPU with CUDA - Comparative Study of Three Algorithms Ray Tracing on a GPU with CUDA - Comparative Study of Three Algorithms (en)
skos:prefLabel	Ray Tracing on a GPU with CUDA - Comparative Study of Three Algorithms Ray Tracing on a GPU with CUDA - Comparative Study of Three Algorithms (en)
skos:notation	RIV/68407700:21230/10:00165738!RIV11-MSM-21230___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	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	283952
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/10:00165738
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	GPU programming; CUDA; performance study; ray tracing; uniform grids; kd-trees; bounding volume hierarchies. (en)
http://linked.open.../riv/klicoveSlovo	kd-trees uniform grids CUDA ray tracing GPU programming bounding volume hierarchies. performance study
http://linked.open...ontrolniKodProRIV	[1D9380A60282]
http://linked.open...v/mistoKonaniAkce	Plzeň
http://linked.open...i/riv/mistoVydani	Pilsen
http://linked.open...i/riv/nazevZdroje	WSCG2010 Communication Papers Proceedings
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Havran, Vlastimil Zlatuška, M.
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2010-02-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Západočeská univerzita v Plzni
https://schema.org/isbn	978-80-86943-87-9
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, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software