A graph-theoretic real-time visible surface editing technique

Abstract

Efficient visible surface (hidden surface) algorithms must make use of information about the structure of the environment, constraints on viewpoint locations and the coherence between successive views in a sequence. Here the visible surface problem is posed as a problem in graph theory. A new technique based on 'updating cut-sets in a graph is presented as… (More)
DOI: 10.1145/563858.563897

Topics

  • Presentations referencing similar topics