Visibility in computer graphics

Jiří Bittner, Peter Wonka

Research output: Contribution to journalArticle

59 Scopus citations

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

ASJC Scopus subject areas

  • Geography, Planning and Development
  • Architecture
  • Urban Studies
  • Nature and Landscape Conservation
  • Management, Monitoring, Policy and Law

Fingerprint Dive into the research topics of 'Visibility in computer graphics'. Together they form a unique fingerprint.

  • Cite this