vistit the homepage Vienna University of TechnologyTECHNISCHE UNIVERSITÄT WIEN
Institut für Computergraphik und Algorithmen
Arbeitsbereich Computergraphik

Home  -   People  -   Courses  -   Research  -   Events  -   Resources  -   Jobs

 Visibility in Computer Graphics

Jiří Bittner, Peter Wonka
Visibility in Computer Graphics
TR-186-2-03-03, March 2003 [ paper]
Information
Replaced by Bittner-2003-Vis.
  • Publication Type: Technical Report
  • Keywords: visibility, real-time rendering, shadows, global illumination

Abstract
Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms in computer graphics aimed to determine visible surfaces in a synthesized image of a 3D scene. Nowadays there are many different visibility algorithms for various visibility problems. We propose a new taxonomy of visibility problems that is based on a classification according to the problem domain. We provide a broad overview of visibility problems and algorithms in computer graphics grouped by the proposed taxonomy. The paper surveys visible surface algorithms, visibility culling algorithms, visibility algorithms for shadow computation, global illumination, point-based and image-based rendering, and global visibility computations. Finally, we discuss common concepts of visibility algorithm design and several criteria for the classification of visibility algorithms.

Additional Files and Images
Additional files:
paper
paper





BibTeX
Download BibTeX-Entry
@techreport\{Bittner-2003-VCG,
  title =      "Visibility in Computer Graphics",
  author =     "Ji{\v r}{\' i} Bittner and Peter Wonka",
  year =       "2003",
  abstract =   "Visibility computation is crucial for computer graphics from
               its very beginning. The first visibility algorithms in
               computer graphics aimed to determine visible surfaces in a
               synthesized image of a 3D scene. Nowadays there are many
               different visibility algorithms for various visibility
               problems. We propose a new taxonomy of visibility problems
               that is based on a classification according to the problem
               domain. We provide a broad overview of visibility problems
               and algorithms in computer graphics grouped by the proposed
               taxonomy. The paper surveys visible surface algorithms,
               visibility culling algorithms, visibility algorithms for
               shadow computation, global illumination, point-based and
               image-based rendering, and global visibility computations.
               Finally, we discuss common concepts of visibility algorithm
               design and several criteria for the classification of
               visibility algorithms.",
  address =    "Favoritenstrasse 9-11/186, A-1040 Vienna, Austria",
  institution = "Institute of Computer Graphics and Algorithms, Vienna
               University of Technology",
  note =       "human contact: technical-report@cg.tuwien.ac.at",
  month =      mar,
  number =     "TR-186-2-03-03",
  keywords =   "visibility, real-time rendering, shadows, global
               illumination",
  URL =        "http://www.cg.tuwien.ac.at/research/publications/2003/Bittner-2003-VCG/",
}

Computer Graphics Group / Research / Publications / 2003 / Bittner-2003-VCG
Maintained by webmaster.
Last update on 1. Dec 04.
Comments to webmaster (at) cg.tuwien.ac.at.
get back to the index

Favoritenstrasse 9-11 / E186, A-1040 Wien, Austria
Tel. +43 (1) 58801-18602, Fax +43 (1) 58801-18698
www.cg.tuwien.ac.at