Campus Event Calendar
Event Entry
What and Who
Kd-tree construction on graphics hardware
Piotr Danilewski
IMPRS-CS
Master Seminar Talk
IMPRS Master Student
AG 1, AG 3, AG 4, AG 5, SWS, RG1, MMCI
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 10 June 2009
13:05
60 Minutes
E1 4
024
Saarbrücken
Abstract
The ultimate goal of Raytracing is to generate realistically-looking images in real time. Fast algorithms for tracing rays are essential but those cannot exist without good acceleration structures of rendered scene. In case of animation, when objects move, it may be needed to update or build from scratch the acceleration structure.
One of the best such structures is a kd-tree. It recursively splits volume of the scene with axis-aligned planes and distributes triangles into one of two generated sub-volumes.
My aim is to utilize the power of modern Graphics Processing Unit to efficiently create the kd-tree. Although my work is not yet complete, the program is already building high quality trees at interactive times - faster than any other algorithm currently in use.
One of the best such structures is a kd-tree. It recursively splits volume of the scene with axis-aligned planes and distributes triangles into one of two generated sub-volumes.
My aim is to utilize the power of modern Graphics Processing Unit to efficiently create the kd-tree. Although my work is not yet complete, the program is already building high quality trees at interactive times - faster than any other algorithm currently in use.
Contact
IMPRS Office Team
0681 93 25 225
--email hidden
passcode not visible
logged in users only
Stephanie Jörg, 06/09/2009 11:19 -- Created document.