Visibility I: Z-buffer algorithm

CS 248 - Introduction to Computer Graphics
Autumn Quarter, 2001
Marc Levoy
Lecture notes for Tuesday, November 13 (finished on Thursday, November 15)

Table of contents:

• Introduction
  • Definition of the visible-surface problem
  • Classifying visible-surface algorithms
  • The input stream
• Zbuffer algorithm
  • Basic loop
  • Computing Z
  • Linear or rational linear interpolation?
  • Complexity
  • Typical performance
  • Other issues
  • Artifacts
  • Antialiasing