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

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

_id	sigradi2004_200
id	sigradi2004_200
authors	Rodrigo Cury Paraizo
year	2004
title	A representação do patrimônio urbano em hiperdocumentos: um estudo sobre o palácio monroe [The Representation of Urban Heritage in Hyperdocuments: A Study on the Monroe Palace]
source	SIGraDi 2004 - [Proceedings of the 8th Iberoamerican Congress of Digital Graphics] Porte Alegre - Brasil 10-12 november 2004
summary	This paper discusses the use of hyperdocuments to portray urban heritage, focusing in the possibilities of narrative structure brought by electronic network narrative. The chosen building is the former house of the Brazilian Senate, the Monroe Palace, for even after being demolished in 1976, is still somehow present as heritage. It also aims to develop a hyperdocument system of recombinatory pieces that allow for individual layouts that can be stored, retrieved and shared among users.
keywords	Virtual heritage; Hyperdocuments, Saint Louis Brazilian Pavilion, Cinelândia, Downtown Rio
series	SIGRADI
email
last changed	2016/03/10 09:59

_id	aa83
authors	Aho, Alfred V., Hopcroft , John E. and Ullman, Jeffrey D.
year	1976
title	The Design and Analysis of Computer Algorithms
source	x, 470 p. : ill Reading, Massachusetts: Addison-Weslely Pub. Co., 1976. includes bibliography: p. [452]-462 and index.
summary	A text book for a first course in design and analysis of algorithms. The emphasis is on ideas and ease of understanding rather then on implementation details or programming tricks. It starts with formulating several models that include random access register machine, random access stored program machine and variants of these, so one can establish analytical results and at the same time accurately reflect on the salient features of real machines
keywords	algorithms, programming
series	CADline
last changed	2003/06/02 13:58

_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	2866
authors	Clark, James H.
year	1976
title	Hierarchical Geometric Model for Visible Surface Algorithms
source	communications of the ACM. October, 1976. vol. 19: pp. 547-554 : ill. includes bibliography
summary	The geometric structure inherent in the definition of the shapes of three-dimensional objects and environments is used not just to define their relative motion and placement, but also to assist in solving many other problems of systems for producing pictures by computers. By using an extension of traditional structure information, or a geometric hierarchy, five significant improvements to current techniques are possible. First, the range of complexity of an environment is greatly increased while the visible complexity of any given scene is kept within a fixed upper limit. Second, a meaningful way is provided to vary the amount of detail presented in a scene. Third, 'clipping' becomes a very fast logarithmic search for the resolvable parts of the environment within the field of view. Fourth, frame to frame coherence and clipping define a graphical 'working set,' or fraction of the total structure that should be present in primary store for immediate access by the visible surface algorithm. Finally, the geometric structure suggests a recursive descent, visible surface algorithm in which the computation time potentially grows linearly with the visible complexity of the scene
keywords	hidden lines, hidden surfaces, data structures, clipping, geometric modeling, algorithms, computer graphics
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

_id	888b
authors	Levin, Joshua
year	1976
title	A Parametric Algorithm for Drawing Pictures of Solid Objects Composed of Quadric Surfaces
source	Communications of the ACM. October, 1976. vol. 19: pp. 555- 563. includes bibliography
summary	An algorithm for drawing pictures of three-dimensional objects, with surfaces made up of patches of quadric surfaces, is described. The emphasis of this algorithm is on calculating the intersections of quadric surfaces. A parametrization scheme is used. Each quadric surface intersection curve (QSIC) is represented as a set of coefficients and parameter limits. Each value of the parameter represents at most two points, and these may easily be distinguished. This scheme can find the coordinates of points of even quartic (fourth-order) intersection curves, using equations of no more than second order. Methods of parametrization for each type of QSIC are discussed, as well as surface bounding and hidden surface removal
keywords	algorithms, curves, curved surfaces, intersection, hidden surfaces, parametrization, computational geometry
series	CADline
last changed	1999/02/12 15:09

_id	22a4
authors	Rogers, D.F.
year	1990
title	Mathematical elements for computer graphics
source	McGraw Hill, USA
summary	The second edition of this classic computer graphics book represents a major rewrite. The clear concise discussion, the detailed algorithms, worked examples and numerous illustrations make the book of special interest to students, programmers and computer graphics professionals. The numerous detailed worked examples make it especially suitable for self-study. The first edition of the book, published in 1976, was one of the earliest computer graphics books. That first edition is still a staple on the bookshelves of many of the pioneers in computer graphics. The book thoroughly covers two- and three-dimensional transformations including rotation, scaling, translation, reflection, rotation about arbitrary points and axes, reflection about arbitrary lines and through arbitrary planes and points at infinity. Plane and space curves including efficient methods for representing conic sections, cubic splines, parabolically blended, Bezier and rational and non-rational B-spline (NURBS) curves are discussed. The discussion of surfaces includes surfaces of revolution, sweep surfaces, ruled and developable surfaces, Coons surfaces, Bezier and rational and non-rational B-splines (NURBS) surfaces. As with all the topics in the book, the discussion of both rational and non-rational B-spline curves and surfaces is accompanied by numerous detailed worked examples. The appendices contain over 50 pseudocoded algorithms including over 25 algorithms for Bezier and B-spline curves and surfaces.
series	other
last changed	2003/04/23 15:14

No more hits.