Visibility in computer graphics

Jiří Bittner, Peter Wonka

Research output: Contribution to journalArticle

56 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)729-755
Number of pages27
JournalEnvironment and Planning B: Planning and Design
Volume30
Issue number5
DOIs
StatePublished - Sep 2003
Externally publishedYes

Fingerprint

computer graphics
Computer graphics
Visibility
visibility
taxonomy
Taxonomies
culling
Lighting

ASJC Scopus subject areas

  • Environmental Science (miscellaneous)

Cite this

Visibility in computer graphics. / Bittner, Jiří; Wonka, Peter.

In: Environment and Planning B: Planning and Design, Vol. 30, No. 5, 09.2003, p. 729-755.

Research output: Contribution to journalArticle

Bittner, Jiří ; Wonka, Peter. / Visibility in computer graphics. In: Environment and Planning B: Planning and Design. 2003 ; Vol. 30, No. 5. pp. 729-755.
@article{497bf964b8144dd28d2fd518b9fff5d0,
title = "Visibility in computer graphics",
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.",
author = "Jiř{\'i} Bittner and Peter Wonka",
year = "2003",
month = "9",
doi = "10.1068/b2957",
language = "English (US)",
volume = "30",
pages = "729--755",
journal = "Environment and Planning B: Planning and Design",
issn = "0265-8135",
publisher = "Pion Ltd.",
number = "5",

}

TY - JOUR

T1 - Visibility in computer graphics

AU - Bittner, Jiří

AU - Wonka, Peter

PY - 2003/9

Y1 - 2003/9

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

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

UR - http://www.scopus.com/inward/record.url?scp=0142040770&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142040770&partnerID=8YFLogxK

U2 - 10.1068/b2957

DO - 10.1068/b2957

M3 - Article

AN - SCOPUS:0142040770

VL - 30

SP - 729

EP - 755

JO - Environment and Planning B: Planning and Design

JF - Environment and Planning B: Planning and Design

SN - 0265-8135

IS - 5

ER -