Continuous Shading of Curved Surfaces
đź“ś 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.
✨ Summary
Summary
Henri Gouraud presents an algorithm for rendering visually smooth images of curved surfaces represented by polygonal meshes. The central problem is that assigning one constant intensity to each polygon makes curved objects appear faceted. Gouraud addresses this by estimating a surface normal at each polygon vertex from the normals of adjacent polygons, computing illumination at the vertices, and interpolating the resulting intensities across each polygon. Because shared vertices receive consistent values, intensity discontinuities between neighboring polygons are suppressed while the underlying polygonal representation remains suitable for hidden-surface processing.
The method is designed for scan-line rasterization. Intensities are interpolated along polygon edges and then across each scan line, allowing the renderer to calculate shades incrementally rather than evaluating the complete lighting model independently at every image point. The paper combines this interpolation strategy with the fast scan-conversion approach developed by Watkins and discusses its suitability for hardware implementation. The resulting images demonstrate that relatively coarse polygonal approximations can produce substantially smoother and more realistic depictions of curved objects, although the polygonal silhouette remains visible and the method does not model shadows or multiple reflections.
The paper became the basis of what is now called Gouraud shading. Subsequent computer-graphics teaching materials and rendering references describe the technique as interpolating vertex colors or illumination values across polygons, and OpenGL documentation identifies this interpolation as a standard rasterization operation. (page.mi.fu-berlin.de) Its principal tradeoff—lower computational cost than per-pixel lighting but reduced accuracy for small or rapidly varying highlights—also motivated later shading methods, including Phong shading. (sciencedirect.com) The paper has been repeatedly cited in computer-graphics textbooks, surveys, and subsequent rendering research, including Real-Time Rendering. (sciencedirect.com)