Continuous Shading of Curved Surfaces

Key Points

Key points are not available for this paper at this time.

Abstract

A procedure for computing shaded pictures of curved surfaces is presented. The surface is approximated by small polygons in order to solve easily the hidden-parts problem, but the shading of each polygon is computed so that discontinuities of shade are eliminated across the surface and a smooth appearance is obtained. In order to achieve speed efficiency, the technique developed by Watkins is used which makes possible a hardware implementation of this algorithm.

Mark Helpful

Bookmark

Relay

Cite This Study

Henri Gouraud (Tue,) studied this question.

synapsesocial.com/papers/6a090b4873218fa1919d22ca https://doi.org/https://doi.org/10.1109/t-c.1971.223313

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra1970 · 91 citations
2A procedure for generation of three-dimensional half-toned computer graphics presentations1970 · 115 citations
3BE VISION, A Package of IBM 7090 FORTRAN Programs to Draw Orthographic Views of Combinations of Plane and Quadric Surfaces1966 · 70 citations
4Mach bands: Quantitative studies on neural networks in the retina1966 · 194 citations
5SURFACES FOR COMPUTER-AIDED DESIGN OF SPACE FORMS1967 · 655 citations

Mark Helpful

Bookmark

Relay