Campus Event Calendar
Event Entry
What and Who
A Framework for Exact Visibility Computations
Jiri Bittner
TU Wien
AG4 Group Meeting
AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 4 March 2004
13:00
45 Minutes
46.1 - MPII
019
Saarbrücken
Abstract
Visibility computation is crucial for computer graphics from its very beginning and nowadays there is a plethora of visibility algorithms for solving various visibility problems. I will present a taxonomy of visibility problems based on the dimension of the associated set of lines. Then I outline a framework suitable for exact and efficient solution of several classes of visibility problems. The central idea of the framework is the occlusion tree representing an aggregated occlusion map by means of a hierarchical subdivision of line space. I will discuss two applications of the framework: computing exact from-region visibility in 2D and 3D scenes. Finally, I will show how to use the presented algorithms for visibility preprocessing, occluder synthesis, and discontinuity meshing.
Contact
Volker Blanz
--email hidden
passcode not visible
logged in users only
Volker Blanz, 02/25/2004 12:25
Volker Blanz, 02/23/2004 11:35 -- Created document.
Volker Blanz, 02/23/2004 11:35 -- Created document.