In 1974 Catmull developed a new algorithm for rendering images of bivariate surface patches. This paper describes extensions of this algorithm in the areas of texture simulation and lighting models. The parametrization of a patch defines a coordinate system which is used as a key for mapping patterns onto the surface. The intensity of the pattern at each picture element is computed as a weighted average of regions of the pattern definition function. The shape and size of this weighting function are chosen using digital signal processing theory. The patch rendering algorithm allows accurate computation of the surface normal to the patch at each picture element, permitting the simulation of mirror reflections. The amount of light coming from a given direction is modeled in a similar manner to the texture mapping and then added to the intensity obtained from the texture mapping. Several examples of images synthesized using these new techniques are included.
[1]
Martin E. Newell,et al.
A solution to the hidden surface problem
,
1998
.
[2]
Robert A. Schumacker,et al.
A Characterization of Ten Hidden-Surface Algorithms
,
1974,
CSUR.
[3]
A. R. Forrest,et al.
On coons and other methods for the representation of curved surfaces
,
1972,
Comput. Graph. Image Process..
[4]
Bui Tuong Phong.
Illuminat~on for computer generated images
,
1973
.
[5]
John E Warnock,et al.
A Hidden Line Algorithm for Halftone Picture Representation
,
1968
.
[6]
Franklin C. Crow,et al.
The aliasing problem in computer-synthesized shaded images.
,
1976
.
[7]
Henry Gouraud,et al.
Computer Display of Curved Surfaces
,
1971,
Outstanding Dissertations in the Computer Sciences.