Visibility in Computer Graphics

  		         Jiri Bittner

I will introduce a classification of visibility problems in two and
three dimensions that is based on the dimension of the space of lines
involved. In particular the following three classes will be discussed:
visibility along a line, visibility from a point, and visibility from
a region. I will present a conservative hierarchical
visibility-from-point algorithm that is suitable for real time
visibility culling. Finally, an algorithm solving the problem of
visibility from a region will be outlined.