Campus Event Calendar
Event Entry
What and Who
On query optimal BVH construction algorithms
Rossen Dimov
IMPRS-CS
Master Seminar Talk
IMPRS Master Student
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, RG2
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 24 June 2008
13:05
60 Minutes
E1 4
024
Saarbrücken
Abstract
Point visibility queries are a well known problem in computational
geometry. They are also a major building block of photo-realistic
image synthesis. Despite their simple definition: find out whether two
points are mutually visible and if not find the closest obstacle to
the first point, efficient point queries are still an open problem.
For repetitive queries on static geometry, efficiency is achieved
through spatial index structures.
In this talk we present a short overview of the common spatial index
structures in computer graphics, with emphasis on construction
algorithms and the trade-off between construction speed and query
speed. We focus on Bounding Volume Hierarchies, an spatial index
structure regarded currently as most practical, with respect to
computer graphics. In the main part of the talk we discuss several new
and unpublished approaches for query optimized BVHs. Finally, we show
practical results for one of them.
geometry. They are also a major building block of photo-realistic
image synthesis. Despite their simple definition: find out whether two
points are mutually visible and if not find the closest obstacle to
the first point, efficient point queries are still an open problem.
For repetitive queries on static geometry, efficiency is achieved
through spatial index structures.
In this talk we present a short overview of the common spatial index
structures in computer graphics, with emphasis on construction
algorithms and the trade-off between construction speed and query
speed. We focus on Bounding Volume Hierarchies, an spatial index
structure regarded currently as most practical, with respect to
computer graphics. In the main part of the talk we discuss several new
and unpublished approaches for query optimized BVHs. Finally, we show
practical results for one of them.
Contact
imprs
(06 81) 93 25 225
--email hidden
passcode not visible
logged in users only
Jennifer Gerling, 06/19/2008 19:24
Jennifer Gerling, 06/19/2008 14:14
Jennifer Gerling, 06/19/2008 14:14 -- Created document.
Jennifer Gerling, 06/19/2008 14:14
Jennifer Gerling, 06/19/2008 14:14 -- Created document.