|
30: Visibility, Problems, Techniques, and Applications
Monday, Full Day, 8:30 am - 5 pm
Room 404
Visibility
determination (the process of deciding what surfaces can
be seen from a certain point) is one of the fundamental
problems in computer graphics. Its importance has long
been recognized, and in network-based graphics, virtual
environments, shadow determination, global illumination,
culling, and interactive walkthroughs, it has become a
critical issue. This course reviews fundamental issues,
current problems, and unresolved solutions, and presents
an in-depth study of the visibility algorithms developed
in recent years, focusing on occlusion culling techniques.
Prerequisites
Understanding of the basics of 3D graphics. The course
is not designed for experts in visibility.
Topics
Occlusion culling techniques, visibility complex, view
volume culling, image space and object-space methods,
the use of BSP trees and other hierarchical structures
for visibility, solutions in games, hardware-assisted
occlusion culling.
Organizer
Daniel Cohen-Or
Tel Aviv University
Lecturers
Yiorgos Chrysanthou
University College London
Daniel Cohen-Or
Vladlen Koltun
Tel Aviv University
Fredo Durand
Massachusetts Institute of Technology
Ned Greene
NVIDIA Corporation
Claudio T. Silva
AT&T Labs |
|
