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

Hits 61 to 75 of 75

_id a9d9
authors Rosenthal, David S.H.
year 1980
title Tools for Constructing User Interfaces
source 1980? 11 p. includes bibliography
summary A review of the tools available for easing the tasks of constructing and modifying the user interface of CAD application programs
keywords user interface, programming, tools, CAD
series CADline
last changed 2003/06/02 11:58

_id c380
authors Saaty, Thomas L. and Beltran, Miguel H.
year 1980
title Architectural Design by the Analytic Hierarchy Process
source Design Methods and Theories. 1980? vol. 14: pp. 124-134 : ill. and tables. include some bibliographical notes
summary The Analytic Hierarchy Process (AHP), which is explained and applied in another article in the same journal, is used to illustrate the architectural design of a house for a family of three. The plan of the house was develop to satisfy the family's needs by considering the size of the lot, the size and shape of the different architectural spaces, their priorities, and their overall contiguity. The salient feature of this paper is to show how closely the final plan, shape, size, geometric design and location relate to our mental criteria and personal needs, from the identification of the needs to the final plan. This approach also permits one to treat all these needs and their relation to the environment in a coherent framework
keywords architecture, design, methods
series CADline
last changed 2003/06/02 11:58

_id c5c4
authors Samet, Hanan
year 1980
title Region Representation : Quadtrees from Boundary Codes
source Communications of the ACM. March, 1980. vol. 23: pp. 163-170 : some ill. includes bibliography
summary An algorithm is presented for constructing a quadtree for a region given its boundary in the form of a chain code. Analysis of the algorithm reveals that its execution time is proportional to the product of the perimeter and the log of the diameter of the region
keywords representation, data structures, quadtree, image processing
series CADline
last changed 1999/02/12 14:09

_id 6f57
authors Searle, John R.
year 1980
title Minds, Brains, and Programs
source The Behavioral and Brain Sciences. Cambridge University Press., 1980. vol. 3: pp. 417-457. includes bibliography
summary This article can be viewed as an attempt to explore the consequences of two propositions: (1) Intentionallity in human beings (and animals) is a product of causal features of the brain. The author assumes this is an empirical fact about the actual causal relations between mental processes and brains. It says simply that certain brain processes are sufficient for intentionallity. (2) Instantiating a computer program is never by itself a sufficient condition of intentionallity. The main argument of this paper is directed at establishing this claim. The form of the argument is to show how a human agent could instantiate the program and still not have the relevant intentionallity. These two propositions have the following consequences: (3) The explanation of how the brain produces intentionallity cannot be that it does it by instantiating a computer program. This is a strict logical consequence of 1 and 2. (4) Any mechanism capable of producing intentionallity must have causal powers equal to those of the brain. This is meant to be a trivial consequence of 1. (5) Any attempt literally to create intentionallity artificially (strong AI) could not succeed just by designing programs but would have to duplicate the causal powers of the human brain. This follows from 2 and 4. 'Could a machine think?' On the argument advanced here only a machine could think, and only very special kinds of machines, namely brains and machines withÔ h) 0*0*0*°° ÔŒ internal causal powers equivalent to those of brains
keywords And that is why strong AI has little to tell us about thinking, since
series CADline
last changed 2003/06/02 08:24

_id 44a3
authors Shen, Tie Gang
year 1996
title Today’s CAAD in China
source CAADRIA ‘96 [Proceedings of The First Conference on Computer Aided Architectural Design Research in Asia / ISBN 9627-75-703-9] Hong Kong (Hong Kong) 25-27 April 1996, pp. 249-252
summary The research and application of CAAD in China was in about the 1980’s. Though a lot of success has been achieved in these ten years or so, the improvement is still relatively minor when compared with some other speciality. In fact there are only very few architects who are really making use of CAAD. In this paper, I would like to analyze the present situation and countermeasure CAAD in China.
series CAADRIA
last changed 1999/01/31 14:22

_id 952f
authors Soloway, E., Guzdial, M. and Hay, K.
year 1994
title Learner-Centered Design: The Challenge for HCI in the 21st Century
source Interactions , no. April (1994): 36-48
summary In the 1980's a major transformation took place in the computing world: attention was finally being paid to making computers easier-to-use. You know the history: in the 1970's folks at Xerox were exploring so-called personal computers and developing graphical, point-and-click interfaces. The goal was to make using computers less cognitively taxing, there- by permitting the user to focus more mental cycles on getting the job done. For some time people had recognized that there would be benefits if users could interact with computers using visual cues and motor movements instead of testu- al/linguistic strings. However, computer cycles were costly; they could hardly be wasted on supporting a non-textual interface. There was barely enough zorch (i.e., computer power, measured in your favorite unit) to simply calculate the payroll.
series journal paper
last changed 2003/04/23 13:50

_id 9fcb
authors Steele, Guy Lewis
year 1980
title The Definition and Implementation of a Computer Programming Language Based Constraints
source MIT - AITR-595
summary The constraint paradigm is a model of computation in which values are deduced whenever possible, under the limitation that deductions be local in a certain sense. One may visualize a constraint 'program' as a network of devices connected by wires. Data values may flow along the wires, and computation is performed by the devices. A device computes using only locally available information (with a few exceptions), and places newly derived values on other, locally attached wires. In this way computed values are propagated. An advantage of the constraint paradigm (not unique to it) is that a single relationship can be used in more than one direction. The connections to a device are not labelled as inputs and outputs; a device will compute with whatever values are available, and produce as many new values as it can. General theorem provers are capable of such behavior, but tend to suffer from combinatorial explosion; it is not usually useful to derive all the possible consequences of a set of hypotheses. The constraint paradigm places a certain kind of limitation on the deduction process. The limitations imposed by the constraint paradigm are not the only one possible. It is argued, however, that they are restrictive enough to forestall combinatorial explosion in many interesting computational situations, yet permissive enough to allow useful computations in practical situations. Moreover, the paradigm is intuitive: It is easy to visualize the computational effects of these particular limitations, and the paradigm is a natural way of expressing programs for certain applications, in particular relationships arising in computer-aided design. A number of implementations of constraint-based programming languages are presented. A progression of ever more powerful languages is described, complete implementations are presented and design difficulties and alternatives are discussed. The goal approached, though not quite reached, is a complete programming system which will implicitly support the constraint paradigm to the same extent that LISP, say, supports automatic storage management.
series thesis:PhD
email gls@labean.East.Sun.COM
last changed 2003/02/12 21:37

_id fc80
authors Ubbelohde, S. and Humann, C.
year 1998
title Comparative Evaluation of Four Daylighting Software Programs
source 1998 ACEEE Summer Study on Energy Efficiency in Buildings Proceedings. American Council for an Energy-Efficient Economy
summary By the mid-1980's, a number of software packages were under development to predict daylighting performance in buildings, in particular illumination levels in daylighted spaces. An evaluation in 1988 by Ubbelohde et al. demonstrated that none of the software then available was capable of predicting the simplest of real daylighting designs. In the last ten years computer capabilities have evolved rapidly and we have four major packages widely available in the United States. This paper presents a comparative evaluation from the perspective of building and daylighting design practice. A contemporary building completed in 1993 was used as a base case for evaluation. We present the results from field measurements, software predictions and physical modeling as a basis for discussing the capabilities of the software packages in architectural design practice. We found the current software packages far more powerful and nuanced in their ability to predict daylight than previously. Some can accurately predict quantitative daylight performance under varying sky conditions and produce handsome and accurate visualizations of the space. The programs differ significantly, however, in their ease of use, modeling basis and the emphasis between quantitative predictions and visualization in the output.
series other
last changed 2003/04/23 13:50

_id c153
authors Ullman, Jeffrey D.
year 1980
title Principles of Database Systems
source 379 p. : ill. Potomac, Maryland: Computer Science Press, 1980. includes bibliography: p.360-371 and index. -- (Computer Software Engineering Series)
summary A large part is a description of relations, their algebra and calculus, and the query languages that have been designed using these concepts. There are explanations of how the theory can be used to design good systems. A description of the optimization of queries in relation-based query languages is provided, and a chapter is devoted to the recently developed protocols for guaranteeing consistency in databases that are operated on by many processes concurrently
keywords database, systems, theory, relational database, education, techniques
series CADline
last changed 2003/06/02 11:58

_id ddss9860
id ddss9860
authors Vakalo, E-G. and Fahmy, A.
year 1998
title A Theoretical Framework for the Analysis and Derivation of Orthogonal Building Plans and Sections
source Timmermans, Harry (Ed.), Fourth Design and Decision Support Systems in Architecture and Urban Planning Maastricht, the Netherlands), ISBN 90-6814-081-7, July 26-29, 1998
summary Architects are generally perceived as “Formgivers with an extraordinary gift” (Ackerman, 1980:12). Implicit in this statement is the belief that the operations that architects employ to compose their designs are the product of a creative faculty that is beyond the reach of rational discourse, and thereby cannot be subjected to logical investigation. This view is detrimental to the advancement of knowledge about architectural composition and adversely affects both practice and education in architecture. More specifically, it prevents the architectural community from acquiring of a more refined conception about how architects derive their designs. In contrast to this view, this study demonstrates that architectural form-making is amenable to logical analysis. In specific, this is to be done through a theoretical and computational framework that describe and explain the tasks involved in the making of orthogonal building plans and sections. In addition to illustrating the susceptibility of architectural form-making to logical analysis, the frameworks proposed in this study overcome the limitations of previously established theories thatdeal with architectural form-making. These can be divided into two categories: normative and positive theories.Normative theories include architectural treatises and manifestos. A major limitation of normativetheories is that they have limited explanatory power. Their concern is with promoting a specific aesthetic ideology and prescribing rules that can be used to derive compositions that conform to it. Therefore, they cannot be used to explain form-making in general. Positive frameworks, such asshape grammar, rely on rules to describe derivation and analysis processes. Nevertheless, they do not provide a comprehensive description of the tasks involved in architectural form-making. This causes the relation between the rules and compositional tasks to be ambiguous. It also affects adversely the ability of these frameworks to provide architects with a complete understanding of the role of compositional rules in derivation or analysis processes.
series DDSS
type normal paper
last changed 2010/05/16 07:11

_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
last changed 2003/05/16 18:58

_id 0763
authors Waite, Mitchell
year 1980
title Computer Graphics Primer
source [ix], 184 p. : ill. (some col.) Indianapolis, Indiana: Howard W. Sams & Co., Inc., 1980. includes index
summary The book contains four chapters: Chapter 1 explains what is computer graphics all about. Chapter 2 introduces the general hardware and software concept behind computer graphics, and presents a profile of products available at the time. Chapter 3 introduces the graphic features of the Apple II computer: plotting simple equations, drawing lines and vectors, creation of simple geometric shapes as well as gaming figures, shape shifting, random art work, detailed drawing and the use of digitizing tables and moving figure animation
keywords computer graphics, animation, education
series CADline
last changed 1999/02/12 14:10

_id eea9
authors Weiler, Kevin
year 1980
title Polygon Comparison Using a Graph Representation
source SIGGRAPH '80 Conference Proceedings July, 1980. vol. 14 ;no. 3: pp. 10-18 : ill. includes bibliography.
summary All of the information necessary to perform the polygon set operations (union, intersection, and difference) and therefore polygon clipping can be generated by a single application of a process called polygon comparison. This process accepts two or more input polygons and generates one or more polygons as output. These output polygons contain unique homogenous areas, each falling within the domain of one or more input polygons. Each output polygon is classified by the list of input polygons in which its area may be found. The union contour of all input is also generated, completing all of the information necessary to perform the polygon set operations. This paper introduces a polygon comparison algorithm which features reduced complexity due to its use of a graph data representation. The paper briefly introduces some of the possible approaches to the general problem of polygon comparison including the polygon set and clipping problems. The new algorithm is then introduced and explained in detail. The algorithm is sufficiently general to compare sets of concave polygons with holes. More than two polygons can be compared at one time; all information for future comparisons of subsets of the original input polygon sets is available from the results of the initial application of the process. The algorithm represents polygons using a graph of the boundaries of the polygons. These graphs are imbedded in a two dimensional geometric space. The use of the graph representation simplifies the comparison process considerably by eliminating many special cases from explicit consideration. Polygon operations like the ones described above are useful in a variety of application areas, especially those which deal with problems involving two dimensional or projected two dimensional geometric areas. Examples include VLSI circuit design, cartographic and demographic applications, and polygon clipping for graphic applications such as viewport clipping, hidden surface and line removal, detailing, and shadowing
keywords boolean operations, clipping, graphs, polygons, computational geometry, algorithms
series CADline
last changed 1999/02/12 14:10

_id 40ad
authors Yessios, Chris I.
year 1980
title Generation and Visualization of Architectural Forms with Tekton
source 1980? pp. 68-79 : ill. includes bibliography
summary Tekton is an interactive computer aided architectural design software system. It incorporates graphic input and 3-D modeling capabilities, a potent notational system which is based on an algebra like linguistic model for the representation of transformation and spatial compositions, hidden face elimination, shadowing and texture rendering. The latter feature has been specifically designed for the visualization of architectural forms and materials, through renderings of a free hand drawing quality. They are derived by generative semi-random models, included in the system. The Tekton language allows for interactive unlimited editing and modification of previously generated compositions
keywords CAD, architecture, modeling, computer graphics, rendering
series CADline
last changed 2003/06/02 11:58

_id caadria2006_589
id caadria2006_589
authors YU-NAN YEH
year 2006
source CAADRIA 2006 [Proceedings of the 11th International Conference on Computer Aided Architectural Design Research in Asia] Kumamoto (Japan) March 30th - April 2nd 2006, 589-591
summary Computer-Aided Design (CAD) / Computer-Aided Manufacturing (CAM) related research has been discussed since the 1960's (Ryder, G. et al, 2002, Mark Burry, 2002). Indeed, both Frank O. Gehry and Toyo Ito utilized CAD/CAM to create rich architectural form and in so doing gave birth to a new type of aesthetics. The visualization and liberalization of form space is the single most important characteristic attributable to the use of computers as a design tool. By the 1980's, Laser cutting and Rapid Prototyping techniques developed from CAM, became important new digital tools when researchers and designers discussed the development of form in architecture.
series CAADRIA
last changed 2006/04/17 16:48

For more results click below:

show page 0show page 1show page 2this is page 3HOMELOGIN (you are user _anon_789533 from group guest) CUMINCAD Papers Powered by SciX Open Publishing Services 1.002