Continuous Shading of Curved Surfaces

@article{Gouraud1971ContinuousSO,
  title={Continuous Shading of Curved Surfaces},
  author={Henri Gouraud},
  journal={IEEE Transactions on Computers},
  year={1971},
  volume={C-20},
  pages={623-629}
}
  • H. Gouraud
  • Published 1 June 1971
  • Computer Science
  • IEEE Transactions on Computers
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. 

Polygonal subdivision of parametric surfaces

This paper describes an algorithm for the polygonal subdivision of parametric surfaces that needs relatively large memory storage for the great number of polygons.

The Triangle Shading Engine

This paper describes an algorithm implementing the Gouraud-shading of triangles and its realization in hardware, designed as an ASIC to provide an effective and low-cost 3D-extension to graphics subsystems in the PC environment.

On-line polygon refining using a low computation subdivision algorithm

  • Yuan-Chung LeeC. Jen
  • Computer Science
    Proceedings Geometric Modeling and Processing 2000. Theory and Applications
  • 2000
This work proposes a low computation cost algorithm to subdivide a polygon using vertex coordinates and vertex normal vectors of one triangle, which produces decent results with lowest computational complexity.

Normals of the butter y subdivision scheme surfaces and their applications

The paper presents explicit formulas for calculating normals to surfaces generated by the butter y interpolatory subdivision scheme from a general initial triangulation of control points. Two

An Algorithm for Improved Shading of coarsely tessellated Polygonal Objects

An algorithm is presented that uses cubic bezier triangles for interpolation of diffuse and specular component of intensity on coarsely tessellated objects and produces better visual results as compared to Phong Shading at comparatively lower cost.

An Overview of 3D Graphics

  • A. Kilgour
  • Computer Science
    Comput. Graph. Forum
  • 1982
Several different models of the same object may be constructed, with transformations defined between them, in the construction and manipulation within the computer of a model representing some entity or artefact in the outside world.

Realism in Computer Graphics: A Survey

This article surveys most of the major issues to be dealt with when generating realistic images, and covers papers up to December 1985, with a discussion of modeling primitives.

Vector interpolation for surface normal calculation

  • R. Low
  • Mathematics
    The Visual Computer
  • 2005
The problem of approximating a surface normal by linear interpolation across a surface facet is considered from a geometric point of view. This point of view makes the coordinate independence for
...

References

SHOWING 1-10 OF 12 REFERENCES

A hidden surface algorithm for computer generated halftone pictures

A new method for converting data describing three-dimensional objects into data that can be used to generate two-dimensional halftone images is presented, which solves some problems that arise in black and white, and color shading.

The notion of quantitative invisibility and the machine rendering of solids

This paper presents a recently developed scheme for the determination of visibility in a line drawing which enables comparitively high speed calculation and excellent resolution.

An algorithm for producing half-tone computer graphics presentations with shadows and movable light sources

In the years since the introduction of SKETCHPAD an increasing number of graphics systems for line drawing have been developed, and automatic windowing, three-dimensional figures, depth cueing by intensity, and even stereo line drawing are now feasible and in some cases, available in hardware.

A real time visible surface algorithm

The dissertation describes an algorithm designed for a hardware processor capable of displaying solid objects, and a FORTRAN 5 program for simulating the hardware processor.

An algorithm for hidden line elimination

The algorithm presented causes the elimination of hidden lines in the representation of a perspective view of concave and convex plane-faced objects on the picture plane by taking advantage of a reduced number of concaves and automatically recognizing if only one object with no concave points is considered.

BE VISION, A Package of IBM 7090 FORTRAN Programs to Draw Orthographic Views of Combinations of Plane and Quadric Surfaces

The various subroutines of the package and their functions are described in this paper and numerous examples of pictures that were produced by BE VISION are given.

A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra

  • P. Loutrel
  • Computer Science, Mathematics
    IEEE Transactions on Computers
  • 1970
The method presented here for solving the "hidden-line problem" for computer-drawn polyhedra is believed to be faster than previously known methods.

Machine Perception of Three-Dimensional Solids

  • L. Roberts
  • Engineering
    Outstanding Dissertations in the Computer Sciences
  • 1963
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1963.

Computer assisted assembly and rendering of solids