A dynamic span storing method for hidden surface removal

ABSTRACT

A dynamic span storing method is presented to reduce the large space requirement of the conventional z-buffer algorithm for hidden surface removal, but retain the simplicity to calculate spans of polygons. The method is also applied to the conventional scan-line algorithm using span coherence, resulting in a new scan-line algorithm having a much simpler control in span manipulation. A new polygon filling scheme is also presented for span generation, which handles singularities properly in all cases.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS
      I.3.7 Three-Dimensional Graphics and Realism
          Subjects: Visible line/surface algorithms

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS
      I.3.5 Computational Geometry and Object Modeling
          Subjects: Curve, surface, solid, and object representations; Geometric algorithms, languages, and systems

General Terms:
Algorithms