Cumincad : CUMINCAD Papers : Search Results

CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

PDF papers
References

Hits 1 to 3 of 3

Reformat results as: short short into frame detailed detailed into frame

_id	186e
authors	Blinn, J.F. and Newell, M.E.
year	1976
title	Texture and Reflection in Computer Generated Images
source	Communications of the ACM 19 10 542-547
summary	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.
series	journal paper
last changed	2003/11/21 15:16

_id	62c4
authors	Blinn, James F. and Newell, Martin E.
year	1976
title	Texture and Reflection in Computer Generated Images
source	communications of the ACM October, 1976. vol. 19: pp. 542-547 : ill. (col.). includes bibliography.
summary	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
keywords	algorithms, computer graphics, shading, hidden surfaces, texture mapping, curved surfaces, rendering
series	CADline
last changed	2003/06/02 13:58

_id	266a
authors	Klinger, Allen and Dyer, Charles R.
year	1976
title	Experiments on Picture Representation Using Regular Decomposition
source	Computer Graphics and Image Processing. 1976. vol. 5: pp. 68-105 : ill. includes bibliography
summary	The problem of building a computer-searchable data representation for a complex image and the effect of representation on algorithms for scene segmentation into regions is considered. A regular decomposition of picture area into successively smaller quadrants is defined, which involves logarithmic search. This hierarchical search and resulting picture representation are shown to enable rapid access of image data without regard to position, efficient storage, and approximate structural descriptions of constituent patterns. Examples involving solid geometrical objects and alphabetic characters are given
keywords	algorithms, image processing, search, decomposition
series	CADline
last changed	2003/06/02 13:58

No more hits.