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

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

_id	898a
authors	Bay, J.H.
year	2002
title	Cognitive Biases and Precedent Knowledge in Human and Computer-Aided Design Thinking
source	CAADRIA 2002 [Proceedings of the 7th International Conference on Computer Aided Architectural Design Research in Asia / ISBN 983-2473-42-X] Cyberjaya (Malaysia) 18–20 April 2002, pp. 213-220
doi	https://doi.org/10.52842/conf.caadria.2002.213
summary	Cognitive biases (illusions) and potential errors can occur when using precedent knowledge for analogical, pre-parametric and qualitative design thinking. This paper refers largely to part of a completed research (Bay 2001) on how heuristic biases, discussed by Tversky and Kahneman (1982) in cognitive psychology, can affect judgement and learning of facts from precedents in architectural design, made explicit using a kernel of conceptual system (Tzonis et. al., 1978) and a framework of architectural representation (Tzonis 1992). These are used here to consider how such illusions and errors may be transferred to computer aided design thinking.
series	CAADRIA
email
last changed	2022/06/07 07:54

_id	6094
authors	Blinn, J.I.
year	1982
title	A Generalization of Algebraic Surface Drawing
source	ACM Transaction on Graphics, vol. 1, no. 3, pp. 235-256, 1982
summary	The technology of creating realistic and visually interesting images of three- dimensional shapes is advancing on many fronts. One such front is the develop- ment of algorithms for drawing curved surfaces directly from their mathematical definitions rather than by dividing them into large numbers of polygons. Two classes of surfaces which have received attention are the quadric and the bivariate parametric surfaces. Bivariate parametric surfaces are generated by three func- tions of two variables (most popularly polynomials), as the variables take on different values. Algorithms dealing with such surfaces are due to Catmull; Lane, Carpenter, Whitted and Blinn; and Clark.
series	journal paper
last changed	2003/11/21 15:16

_id	b47b
authors	Callender, John Hancock (Ed.)
year	1982
title	Time Saver Standards for Architectural Design Data
source	McGraw Hill Book. Co., Sixth Ed.
summary	From Book News, Inc. The latest version of the venerable reference first published in 1946 and most recently in 1982. Considers such aspects as bioclimate design, life-cycle costing, the building shell, architectural ethics, superstructure, acoustics, construction materials technology, daylighting, environmentally responsible design, and evaluating building performance. A special section features design data formatted according to the Uniformat II classification system, offering easy access to preliminary design and specification by building component, assemble, and place in the system of construction. Useful for any professional in the architecture, design, or construction fields. Book News, Inc.(r), Portland. Book Description Our biggest database of ready-to-use architectural design details ever. A classic reference for over 50 years. Time-Saver Standards for Architectural Design Data, edited by Donald Watson, Michael J. Crosbie, and John Hancock Callender, is the all-in-one desktop database that helps you work faster and smarter with instant design details-ready to incorporate into your architectural drawings the moment you need them. Now in a completely revised and updated seventh edition, this time-saving resource...
series	other
last changed	2003/04/23 15:14

_id	66df
authors	Cendes, Z.J., Minhas, F.U. and Silvester, P.P.
year	1982
title	Universal Finite Element Matrices for Tetrahedra
source	45, [22] p Pittsburgh: Design Research Center, CMU, December, 1982. DRC- 18-58-82. includes bibliography.
summary	Methods are described for forming finite element matrices for a wide variety of operators on tetrahedral finite elements, in a manner similar to that previously employed for line segments and triangles. This technique models the differentiation and product-embedding operators as rectangular matrices, and produces finite element matrices by replacing all required analytic operations by their finite matrix analogues. The method is illustrated by deriving the conventional matrix representation for Laplace's equation. Brief computer programs are given, which generate universal finite element matrices for use in various applications
keywords	mathematics, computational geometry, finite elements, analysis
series	CADline
last changed	2003/06/02 13:58

_id	89e4
authors	Cendes, Z.J., Shenton, D. and H. Shahnasser
year	1982
title	Adaptive Finite Element Mesh Generation Using the Delaunay Algorithm
source	3 p. : ill. Pittsburgh: Design Research Center, CMU, December, 1982
summary	Includes bibliography. A two-dimensional generator is described which automatically creates optimal finite element meshes using the Delaunay triangulation algorithm. The mesh generator is adaptive in the sense that elements containing the largest normalized errors are automatically refined, providing meshes with a uniform error density. The system runs on a PERQ computer made by Three Rivers Computer Company. It is menu oriented and utilizes multiple command and display windows to create and edit the object description interactively. Mesh generation from the object data base is automatic, although it may be modified interactively by the user if desired. Application of the mesh generator to electric machine design and to magnetic bubble simulation shows it to be one of the most powerful and easy to use systems yet devised
keywords	electrical engineering, triangulation, algorithms, OOPS, finite elements, analysis
series	CADline
last changed	2003/06/02 13:58

_id	0650
authors	Fenves, Stephen J. and Rasdorf, William J.
year	1982
title	Role of Database Management Systems in Structural Engineering
source	15 p.: ill Pittsburgh: Design Research Center, CMU, December, 1982. includes bibliography.
summary	--- Presented at International Association of Bridge and Structural Engineers Symposium on Informatics in Structural Engineering.(1982 : Bergamo, Italy). The future integration of structural engineering application programs will depend critically on integrated databases which provide access to information in essentially arbitrary sequences, and which automatically perform a large portion of integrity checking on the data. One source of such design databases are the database management systems (DBMS) evolving from management applications. The paper surveys such systems and presents some extensions needed
keywords	integration, database, DBMS, systems, civil engineering
series	CADline
last changed	2003/06/02 10:24

_id	8d70
authors	Fenves, Stephen J.
year	1982
title	A Note on Flow Networks and Structures
source	Pittsburgh: Design Research Center, CMU, April, 1982. 7, [11] p. : ill
summary	The purpose of this note is to explore certain common features of flow and structural networks, in terms of the effect of the (usually implicit) global equilibrium equations on the range of problems amenable to analysis. The objective is to extend the standard analysis problem and explore the possibility of 'tuning' flow and structural networks by preassigning values of certain inflow and reaction components
keywords	networks, civil engineering, structures, analysis
series	CADline
last changed	2003/06/02 10:24

_id	29bb
authors	Fix, George J. and Ernst, Stephan
year	1982
title	Finite Element Methods of the Least Squares Type for Regions with Corners
source	15 p. : ill Pittsburgh: Design Research Center, CMU, April, 1982. includes bibliography.
summary	This paper treats problems with corner singularities. It is shown that if appropriate weights are used in the least squares formulation, then optimal error estimates can be derived in unweighted L2 norms
keywords	computational geometry, finite elements, mathematics
series	CADline
last changed	2003/06/02 13:58

_id	ad2e
authors	Fix, George J. and Gunzburger, Max D.
year	1982
title	On Numerical Methods for Acoustic Problems
source	14 p. : ill. Pittsburgh: Design Research Center, CMU, April, 1982. include bibliography: p. 12
summary	Finite element methods are introduced for the approximate solution of periodic acoustic problems. A least squares technique is used for those problems which are governed by a first order system of partial differential equations while for second order equations, a Galerkin/multigrid technique is employed. In both cases, the solution process for the algebraic system resulting from discretization is iterative in character
keywords	acoustics, finite elements, mathematics
series	CADline
last changed	2003/06/02 10:24

_id	e323
authors	Holtz, Neal M. and Rasdorf, William J.
year	1982
title	The Use of LISP for Computer-Aided Design Systems
source	18, [19] p. Pittsburgh: Design Research Center, Carnegie-Mellon University, April, 1982. includes bibliography
summary	It is suggested that the LISP programming language has many advantages and few disadvantages for use in developing complex engineering application programs. The paper attempts to explore that possibility by briefly explaining a few of the concepts of the language, by discussing some of the criticisms of it, and by mentioning some new developments. In summary it is suggested that LISP may currently be the best programming language to use for the development of computer- aided design (CAD) systems
keywords	LISP, CAD, systems, programming, languages, CAE, engineering
series	CADline
last changed	2003/06/02 13:58

_id	0095
authors	Kowalski, T.J. and Thomas, Donald E.
year	1982
title	The VLSI Design Automation Assistant : First Step
source	5 p. Design Research Center, CMU, December, 1982. DRC-18-57-82. includes bibliography
summary	This paper describes an approach to VLSI design synthesis using both knowledge-based expert systems and data and control flow analysis. The authors are concerned with design synthesis as it proceeds from an algorithmic description of a VLSI system to a list of technology-independent registers, operators, data paths, and control signals. This paper discusses the development of the Design Automation Assistant from its first interviews with expert VLSI designers to its current prototype state. Four designs of a microcomputer are presented along with the changes in the knowledge base that created those designs
keywords	design, automation, integrated circuits, synthesis, expert systems, systems, knowledge base
series	CADline
last changed	2003/06/02 13:58

_id	941c
id	941c
authors	Maver, T.W. and Ellis, J.
year	1982
title	Implementation of an Energy Model within a Multi-Disciplinary Practice
source	Proceedings of CAD82, Brighton (Ed: A Pipes), Butterworth, 562-570
summary	Implementation of computer software is concerned with trials of its robustness, relevance, and efficacy in the real-world, real-time context of design practice. This paper summarises the trials carried out within the Building Design Partnership of a dynamic energy model, ESP, developed by ABACUS at the University of Strathclyde. Over an 18 month period the program was used on 6 projects to address a variety of design problems over a variety of building types. The paper reports in outline on each of the six: four concerned with the need for a definite answer to a specific question, eg. ''will it overheat in summer"; two concerned to provide, on the one hand for the client, on the other hand for the design practice, paradigms for energy conscious design of hospitals and offices. The conclusions drawn have relevance to the takeup of CAD generally.
series	other
email
last changed	2003/09/03 13:15

_id	46bd
authors	Nestor, J. A. and Thomas, Donald E.
year	1982
title	Defining and Implementing a Multilevel Design Representation with Simulation Applications
source	Design Research Center, CMU, December, 1982. [7] p. includes bibliography
summary	A design representation that incorporates descriptions at more than one level of abstraction is called a multilevel representation. This paper describes a multilevel representation which includes behavioral and structural levels of description, and a multilevel analysis aid, called timing abstraction, which extracts timing information from a structural design and adds it to a behavior level description. With this design aid, alternate implementations of the same behavior, generated using the CMU-DA synthesis software, can be compared using a behavior level simulator. The timing accuracy is that of the microcode implementation, while the speed of the simulation is that of a behavior level simulator
keywords	representation, design, CAD, automation, simulation, electrical engineering, integrated circuits
series	CADline
last changed	2003/06/02 13:58

_id	2415
authors	Nievergelt, J. and Preparata, Franco P.
year	1982
title	Plane-Sweep Algorithms for Intersecting Geometric Figures
source	Communications of the ACM. October, 1982. vol. 25: pp. 739-747 : ill. includes bibliography
summary	Algorithms in computational geometry are of increasing importance in computer-aided design, for example, in the layout of integrated circuits. The efficient computation of the intersection of several superimposed figures is a basic problem. Plane figures defined by points connected by straight line segments are considered, for example, polygons (not necessarily simple) and maps (embedded planar graphs). The regions into which the plane is partitioned by these intersecting figures are to be processed in various ways such as listing the boundary of each region in cyclic order or sweeping the interior of each region. Let m be the total number of points of all the figures involved and s be the total number of intersections of all line segments. A two plane-sweep algorithm that solves the problems above is presented; in the general case (non convexity) in time O((n+s)log-n) and space O(n+s); when the regions of each given figure are convex, the same can be achieved in time O(n log n +s) and space O(n)
keywords	computational geometry, algorithms, intersection, mapping, polygons, data structures, analysis
series	CADline
last changed	2003/06/02 10:24

_id	2243
authors	O'Rourke, J., Chien, C.-B. and Olson, Th. (et al)
year	1982
title	A New Linear Algorithm for Intersecting Convex Polygons
source	Computer Graphics and Image Processing. 1982. vol. 19: pp. 384-391 : ill. includes a short bibliography
summary	An algorithm is presented that computes the intersection of two convex polygons in linear time. The algorithm is fundamentally different from the only known linear algorithms for this problem, due to Shamos and to Hoey. These algorithms depend on a division of the plane into either angular sectors (Shamos) or parallel slabs (Hoey), and are mildly complex. The authors' algorithm searches for the intersection points of the polygons by advancing a single pointer around each polygon, and is very easy to program
keywords	algorithms, boolean operations, polygons, intersection, search
series	CADline
last changed	2003/06/02 14:42

_id	4bae
authors	Rasdorf, William J. and Kutay, Ali R.
year	1982
title	Maintenance of Integrity During Concurrent Access in a Building Design Database
source	Computer Aided Design. Butterworth Scientific Ltd., July, 1982. vol. 14: pp. 201-207. includes bibliography
summary	This paper proposes a building design database model that insures database integrity in a highly flexible relational structure while supporting disciplinary and interdisciplinary concurrent use. The model strongly supports designer-database interaction by providing extremely versatile data access mechanisms and an associated concurrency control mechanism. Building design components are represented in terms of their location, their attribute values, and combinations of the two. Both the logical and physical database models are illustrated. The relational model is vital for achieving the greatest flexibility in representing and accessing building design data. Its standard relations are ideal for information representation. In addition, the operators provided by the model enable the engineer to readily restructure the database to support building design needs. This paper introduces a database structuring mechanism referred to as catalogs. Catalogs provide a highly versatile mechanism for accessing database information by grouping building components into data units called modules. The modules provide convenient access to multiple design entities. Also included is a protection relation that provides a concurrency control environment for the catalog relations. The module concept is particularly important in design because it enables the ad hoc groupings of data which are so often necessary to support the design process. The module is recommended as the level to which a locking concurrency control mechanism be applied. It is a small enough data unit to support concurrency for interdisciplinary design activities, yet not so small as to require extensive overhead in the concurrency control implementation. Two different modes of locking are recommended for the catalog relations of a building design database to achieve maximum concurrency and efficiency of access by designers
keywords	database, concurrency, access, constraints management
series	CADline
last changed	2003/06/02 13:58

_id	452c
authors	Vanier, D. J. and Worling, Jamie
year	1986
title	Three-dimensional Visualization: A Case Study
source	Computer-Aided Architectural Design Futures [CAAD Futures Conference Proceedings / ISBN 0-408-05300-3] Delft (The Netherlands), 18-19 September 1985, pp. 92-102
summary	Three-dimensional computer visualization has intrigued both building designers and computer scientists for decades. Research and conference papers present an extensive list of existing and potential uses for threedimensional geometric data for the building industry (Baer et al., 1979). Early studies on visualization include urban planning (Rogers, 1980), treeshading simulation (Schiler and Greenberg, 1980), sun studies (Anon, 1984), finite element analysis (Proulx, 1983), and facade texture rendering (Nizzolese, 1980). With the advent of better interfaces, faster computer processing speeds and better application packages, there had been interest on the part of both researchers and practitioners in three-dimensional -models for energy analysis (Pittman and Greenberg, 1980), modelling with transparencies (Hebert, 1982), super-realistic rendering (Greenberg, 1984), visual impact (Bridges, 1983), interference clash checking (Trickett, 1980), and complex object visualization (Haward, 1984). The Division of Building Research is currently investigating the application of geometric modelling in the building delivery process using sophisticated software (Evans, 1985). The first stage of the project (Vanier, 1985), a feasibility study, deals with the aesthetics of the mode. It identifies two significant requirements for geometric modelling systems: the need for a comprehensive data structure and the requirement for realistic accuracies and tolerances. This chapter presents the results of the second phase of this geometric modelling project, which is the construction of 'working' and 'presentation' models for a building.
series	CAAD Futures
email
last changed	2003/05/16 20:58

_id	2786
authors	Woodwark, J.R.
year	1989
title	Splitting Set-Theoretic Solid Models into Connected Components
source	10 p. : ill. Winchester: IBM UK Scientific Center, IBM United Kingdom Laboratories Limited, June, 1989. IBM UKSC 210. includes bibliography In general, there is no way to tell how many pieces (connected components) a set-theoretic (CSG) solid model represents, except via conversion to a boundary model. Recent work on the elimination of redundant primitives has been linked with techniques for identifying connected components in quad-trees and oct-trees into a strategy to attack this problem. Some success has been achieved, and an experimental Prolog program, working in two dimensions, that finds connected components and determines the set-theoretic representation of each component, is reported, and further developments proposed. CSG / quadtree / octree / primitives / algorithms. 43. Woodwark, J. R. and Quinlan K. M. 'Reducing the Effect of Complexity on Volume Model Evaluation.' Computer Aided Design. April, 1982. pp. 89-95 : ill. includes bibliography.
summary	A major problem with volume modelling systems is that processing times may increase with model complexity in a worse than linear fashion. The authors have addressed this problem, for picture generation, by repeatedly dividing the space occupied by a model, and evaluating the sub-models created only when they meet a criterion of simplicity. Hidden surface elimination has been integrated with evaluation, in such a way that major portions of the model which are not visible are never evaluated. An example demonstrates a better than linear relationship between model complexity and computation time, and also shows the effect of picture complexity on the performance of the process
keywords	CAD, computational geometry, solid modeling, geometric modeling, algorithms, hidden surfaces, CSG
series	CADline
last changed	2003/06/02 13:58

_id	0107
authors	Akin, Omer and Weinel, Eleanor F. (editors)
year	1982
title	Representation and Architecture
source	v, 285 p. : ill. Silver Spring, Maryland: Information Dynamics, Inc., 1982
summary	A collection of papers developed from the proceeding of the Northeastern Regional meeting of the Association of Collegiate Schools of Architecture (ACSA), held at the Department of Architecture, Carnegie Mellon University. The introduction includes articles about representation, representation and architecture. Part 1, Who/To Whom speaks about representation and participatory design process, and of a system for recording behavior and occupying of design. Part 2, How: includes Figure, System and Memory, the Process of Design ; Representation and Creativity in Architecture and Miniature Substitutes. Part 3, With What :Information and Data Base in Design : the Computer as a Design Medium, Slides Talk and Translation
keywords	design process, representation, architecture, creativity
series	CADline
email
last changed	2003/05/17 10:09

_id	8a88
authors	Anderson, David P.
year	1982
title	Hidden Line Elimination in Projected Grid Surfaces
source	ACM Transactions on Graphics. October, 1982. vol. 1: pp. 274-288 : ill. includes a short bibliography
summary	The hidden line and hidden surface problems are simpler when restricted to special classes of objects. An example is the class of grid surfaces, that is, graphs of bivariate functions represented by their values on a set of grid points. Projected grid surfaces have geometric properties which permit hidden line or hidden surface elimination to be done more easily than in the general case. These properties are discussed in this paper, and an algorithm is given which exploits them
keywords	algorithms, hidden lines, hidden surfaces, grids, computer graphics
series	CADline
last changed	2003/06/02 10:24

For more results click below: