“An analytic visible surface algorithm for independent pixel processing” by Catmull

  • ©Edwin (Ed) Catmull




    An analytic visible surface algorithm for independent pixel processing



    An algorithm is presented that solves the visible surface problem at each pixel independently. This allows motion blur and depth of field blurring to be integrated into the algorithm. It also allows parallel processing. The algorithm works on large numbers of polygons. An analytic Gaussian filter is used. The filter can be elongated or scaled differently for each polygon to adjust for its speed or distance from the focal plane. This is achieved by shrinking or scaling the polygon prior to solving the hidden surface problem so that blurring is correctly presented when objects obscure each other.


    1. COOK, ROB, THOMAS PORTER, AND LOREN CARPENTER, “Distributed Ray Tracing,” Computer Graphics, vol. 18, no. 3, July 1984.
    2. FEIBUSH, ELIOT, MARC LEVOY, AND ROB COOK, “Synthetic Texturing Using Digital Filtering,” Computer Graphics, vol. 14, no. 3, pp. 294-301, July 1980.
    3. KOREIN, JONATHAN AND NORMAN BADLER, “Temporal Anti-Aliasing in Computer Generated Animation,” Computer Graphics, vol. 17, no. 3, pp. 377-388, July 1983.
    4. POTMESIL, MICHAEL AND INDRANIL CHAKRAVARTY, “Modeling Motion Blur in Computer-Generated Images,” Computer Graphics, vol. 17, no. 3, pp. 389-399, July 1983.
    5. SUTHERLAND, IVAN, ROBERT SPROULL, AND ROBERT SCHUMACKER, “A Characterization of Ten Hidden-surface Algorithms,” ACM Computing Surveys, March 1974.
    6. SUTHERLAND, IVAN AND G. W. HODGMAN, “Reentrant Polygon Clipping,” CACM, January 1974.
    7. WEILER, KEVIN AND PETER ATHERTON, “Hidden-surface Removal Using Polygon Area Sorting,” Computer Graphics Proceedings, 1977.

ACM Digital Library Publication: