Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Popov, Stefan
Günther, Johannes
Seidel, Hans-Peter
Slusallek, Philipp

dblp
dblp
dblp
dblp

Not MPG Author(s):

Popov, Stefan
Slusallek, Philipp

Editor(s):

Cohen-Or, Daniel
Slavik, Pavel

dblp
dblp

Not MPII Editor(s):

Cohen-Or, Daniel
Slavik, Pavel

BibTeX cite key*:

popov:07:GPURT

Title, Booktitle

Title*:

Stackless KD-Tree Traversal for High Performance GPU Ray Tracing

Booktitle*:

Computer Graphics Forum (Proc. EUROGRAPHICS)

Event, URLs

URL of the conference:


URL for downloading the paper:

http://www.mpi-inf.mpg.de/~guenther/StacklessGPURT/StacklessGPURT.pdf

Event Address*:

Prague, Czech Republic

Language:

English

Event Date*
(no longer used):


Organization:

European Association for Computer Graphics

Event Start Date:

3 September 2007

Event End Date:

7 September 2007

Publisher

Name*:

Blackwell

URL:

http://www.blackwellpublishing.com/

Address*:

Oxford, UK

Type:


Vol, No, Year, pp.

Series:


Volume:

26(3)

Number:

3

Month:

September

Pages:

415-424

Year*:

2007

VG Wort Pages:

28

ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Significant advances have been achieved for realtime ray
tracing recently, but realtime performance for complex
scenes still requires large computational resources not yet
available from the CPUs in standard PCs. Incidentally, most
of these PCs also contain modern GPUs that do offer much
larger raw compute power. However, limitations in the
programming and memory model have so far kept the
performance of GPU ray tracers well below that of their CPU
counterparts.

In this paper we present a novel packet ray traversal
implementation that completely eliminates the need for
maintaining a stack during kd-tree traversal and that
reduces the number of traversal steps per ray. While CPUs
benefit moderately from the stackless approach, it improves
GPU performance significantly. We achieve a peak performance
of over 16 million rays per second for reasonably complex
scenes, including complex shading and secondary rays.
Several examples show that with this new technique GPUs can
actually outperform equivalent CPU based ray tracers.

Keywords:

ray tracing, graphics hardware, stackless traversal, kd-tree

HyperLinks / References / URLs:

http://www.mpi-inf.mpg.de/~guenther/StacklessGPURT/index.html



Download
Access Level:

Intranet

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Computer Graphics Group

Audience:

popular

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{popov:07:GPURT,
AUTHOR = {Popov, Stefan and G{\"u}nther, Johannes and Seidel, Hans-Peter and Slusallek, Philipp},
EDITOR = {Cohen-Or, Daniel and Slavik, Pavel},
TITLE = {Stackless KD-Tree Traversal for High Performance {GPU} Ray Tracing},
BOOKTITLE = {Computer Graphics Forum (Proc. EUROGRAPHICS)},
JOURNAL = {Computer Graphics Forum},
PUBLISHER = {Blackwell},
YEAR = {2007},
ORGANIZATION = {European Association for Computer Graphics},
NUMBER = {3},
VOLUME = {26(3)},
PAGES = {415--424},
ADDRESS = {Prague, Czech Republic},
MONTH = {September},
ISBN = {0167-7055},
}


Entry last modified by Thomas Schultz, 03/20/2009
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Johannes Günther
Created
06/12/2007 10:49:16 AM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Thomas Schultz
Uwe Brahm
Anja Becker
Anja Becker
Anja Becker
Edit Dates
03/20/2009 06:44:46 PM
02/28/2008 04:24:10 PM
14.02.2008 14:28:58
14.02.2008 14:23:57
12/12/2007 09:33:02 AM