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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00221404" target="_blank" >RIV/68407700:21230/14:00221404 - isvavai.cz</a>

Result on the web

<a href="http://www.sccg.sk/" target="_blank" >http://www.sccg.sk/</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

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

Original language 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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GAP202%2F12%2F2413" target="_blank" >GAP202/12/2413: Optimal Algorithms for Image Synthesis</a><br>

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2014

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

30th Spring conference on Computer Graphics

ISBN

978-80-223-3601-7

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

61-68

Publisher name

Comenius University

Place of publication

Bratislava

Event location

Smolenice

Event date

May 28, 2014

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—