Visibility in Computer Graphics

Jiří Bittner and Peter Wonka
Additional contact information
Jiří Bittner: Center for Applied Cybernetics, Czech Technical University in Prague, Karlovo Namesti 13, 121 35 Praha 2, Czech Republic
Peter Wonka: Vienna University of Technology, Institute of Computer Graphics and Algorithms, Favoritenstrasse 9-11/E186, A-1040 Wien, Austria

Environment and Planning B, 2003, vol. 30, issue 5, 729-755

Abstract: Visibility computation was 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 three-dimensional 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. We survey 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.

Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b2957 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:30:y:2003:i:5:p:729-755

DOI: 10.1068/b2957

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().