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 4 of 4

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

_id	6054
authors	Cook, R.L.
year	1984
title	Shade Trees
source	Computer Graphics, Vol. 18, No.3, pp.223-23 1
summary	Shading is an important part of computer imagery, but shaders have been based on fixed models to which all surfaces must conform. As computer imagery becomes more sophisticated, surfaces have more complex shading characteristics and thus require a less rigid shading model. This paper presents a flexible tree-structured shading model that can represent a wide range of shading characteristics. The model provides an easy means for specifying complex shading characteristics. It is also efficient because it can tailor the shading calculations to each type of surface.
series	journal paper
last changed	2003/04/23 15:14

_id	ea4c
authors	Chang, Hsi and Iyengar, S. Sitharama
year	1984
title	Efficient Algorithms to Globally Balance a Binary Search Tree
source	Communications of the ACM. July, 1984. vol. 27: pp. 695-702. includes bibliography
summary	A binary search tree can be globally balanced by readjustment of pointers or with a sorting process in O(n) time, n being the total number of nodes. This paper presents three global balancing algorithms, one of which uses folding with the other two adopting parallel procedures. These algorithms show improvement in time efficiency over some sequential algorithms when applied to large binary search trees. A comparison of various algorithms is presented
keywords	techniques, parallel processing, algorithms, search, sorting
series	CADline
last changed	2003/06/02 13:58

_id	8dce
authors	Manna, Zohare and Waldinger, Richard
year	1984
title	The Logical Basis for Computer Programming : Deductive Reasoning
source	2 v. : ill Reading, Mass.: Addison-Wesley Pub. Co., 1984. vol.1: includes bibliography v.1 p.: [579]-581 and index. -- CADLINE has vol. 1 only. (Addison-Wesley Series in Computer Science)
summary	An introduction to the basic notions of propositional and predicate logic and special theories including integers, strings, trees, lists, sets, and tuples (arrays). Algorithms are expressed not as explicit programs but as the definitions of functions and relations within these theories
keywords	logic, programming, AI, reasoning
series	CADline
last changed	2003/06/02 13:58

_id	0589
authors	Weghorst, H., Hooper, G., and Greenberg, D.
year	1984
title	Improved Computational Methods for Ray Tracing
source	ACM Trans. on Graphics, vol. 3, no. 1, pp. 52-69, Jan. 1984
summary	This paper describes algorithmic procedures that have been implemented to reduce the computational expense of producing ray-traced images. The selection of bounding volumes is examined to reduce the computational cost of the ray-intersection test. The use of object coherence, which relies on a hierarchical description of the environment, is then presented. Finally, since the building of the ray-intersection trees is such a large portion of the computation, a method using image coherence is described. This visible-surface preprocessing method, which is dependent upon the creation of an "item buffer," takes advantage of a priori image information. Examples that indicate the efficiency of these techniques for a variety of representative environments are presented.
series	other
last changed	2003/04/23 15:50

No more hits.