In 1974 Ed 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 parametric values within each picture element are input to a pattern definition function. A weighted average of the values of this function over the picture element scales the intensity of that picture element. By suitably defining the pattern function, various surfaces textures can be simulated. The shape and size of this weighting function is chosen using digital signal processing theory.The other problem addressed here concerns lighting models. The patch rendering algorithm allows accurate computation of the surface.
[1]
Bui Tuong Phong.
Illuminat~on for computer generated images
,
1973
.
[2]
A. R. Forrest,et al.
On coons and other methods for the representation of curved surfaces
,
1972,
Comput. Graph. Image Process..
[3]
Gary S. Watkins,et al.
A real time visible surface algorithm
,
1970
.
[4]
Henry Gouraud,et al.
Computer Display of Curved Surfaces
,
1971,
Outstanding Dissertations in the Computer Sciences.
[5]
Martin E. Newell,et al.
A solution to the hidden surface problem
,
1972,
ACM Annual Conference.
[6]
Franklin C. Crow,et al.
The aliasing problem in computer-synthesized shaded images.
,
1976
.
[7]
John E Warnock,et al.
A Hidden Line Algorithm for Halftone Picture Representation
,
1968
.