Campus Event Calendar
Event Entry
What and Who
On query optimal BVH construction algorithms
Rossen Dimov
Fachrichtung Informatik - Saarbrücken
PhD Application Talk
DAAD 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
Tuesday, 14 July 2009
09:00
240 Minutes
E1 4
024
Saarbrücken
Abstract
Using good acceleration structures is a major factor in achieving real time rendering with ray tracing. Bounding Volume Hierarchies (BVHs) are very flexible and have competitive performance to the other most used acceleration structures. Naturally, they have become object of the current research with focus on fast construction. A step of the classical construction algorithm consists of partitioning a given set of scene’s primitives into two non overlapping subsets such that a predefined cost function has global minima. Due to the exponential nature of that problem the classical construction applies an assumption which limits the space of possible solutions and finding an optimal one is not guaranteed.
Contrary to the recent research we have worked towards improving the quality of the BVHs while searching throughout the space of possible solutions. Using domain specific properties and the linearity of the cost function we implemented a complex generic algorithm that is able to find optimal divisions in polynomial time. Based on number of experiments we concluded, that in terms of ray tracing a spatial
partitioning gives the best results.
Contrary to the recent research we have worked towards improving the quality of the BVHs while searching throughout the space of possible solutions. Using domain specific properties and the linearity of the cost function we implemented a complex generic algorithm that is able to find optimal divisions in polynomial time. Based on number of experiments we concluded, that in terms of ray tracing a spatial
partitioning gives the best results.
Finally we implemented a simplified specialized version of the generic algorithm which performs better in most cases than the traditional algorithms and has comparable construction times.
Contact
IMPRS Office Team
0681 9325 225
--email hidden
passcode not visible
logged in users only
Stephanie Jörg, 07/08/2009 12:24 -- Created document.