“Visibility, Problems, Techniques, and Applications” by Cohen-Or, Chrysanthou, Koltun, Durand, Greene, et al. …

  • ©Daniel Cohen-Or, Yiorgos Chrysanthou, Vladlen Koltun, Frédo Durand, Ned Greene, and Claudio T. Silva

Conference:


Entry Number: 30

Title:

    Visibility, Problems, Techniques, and Applications

Course Organizer(s):



Presenter(s):



Abstract:


    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.

    Description
    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.

     

     


Type: