“A visible polygon reconstruction algorithm” by Sechrest and Greenberg

  • ©Stuart Sechrest and Donald P. Greenberg




    A visible polygon reconstruction algorithm



    An algorithm for determining visible lines or visible surfaces in polygonal form, at object resolution, is presented. The original scene must consist of non-intersecting planar polygons. The procedure relies on image coherence, since the sampling is dependent on the complexity of the image. The reconstruction method is based on an elaborate data structure, which allows the polygonal output to be easily obtained. The polygonal output is useful for smooth shaded or textured images, as well as the for creation of shadows.


    1. Atherton, P., Weiler, K. and Greenberg, D., “Polygon Shadow Generation,” Computer Graphics, Vol. 12, No 3 (August 1978), pp 275-281.
    2. Cook, R. L., “Polygonal Database User’s Guide,” unpublished, 1981.
    3. Feibush, E. A., Levoy, M. and Cook, R. L., “Synthetic Texturing Using Digital Filters,” Computer Graphics, Vol. 14, No 3 (July 1980), pp 294-301.
    4. Franklin, W. R., “A Linear Time Exact Hidden Surface Algorithm,” Computer Graphics, Vol. 14, No 3 (July 1980), pp 117-123.
    5. Hamlin, G. Jr and Gear C. W., “Raster-Scan Hidden Surface Algorithm Techniques,” Computer Graphics, Vol. 11, No 2 (Summer 1977), pp 206-213.
    6. Sutherland, I. E., “Polygon Sorting by Subdivision: A Solution to the Hidden-Surface Problem,” unpublished, 1973.
    7. Weiler, K. and Atherton, P., “Hidden Surface Removal using Polygon Area Sorting,” Computer Graphics, Vol. 11, No 2 (Summer 1977), pp 214-222.

ACM Digital Library Publication: