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 134

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

_id	ca8e
authors	Bentley, Jon L.
year	1975
title	Multidimensional Binary Search Trees Used for Associative Searching
source	communications of the ACM September, 1975. vol. 18: pp. 509-517 : ill. includes bibliography.
summary	This paper develops the multidimensional binary search tree (or k-d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k-d tree is defined and examples are given. It is shown to be quite efficient in its storage requirements. A significant advantage of this structure is that a single data structure can handle many types of queries very efficiently. Various utility algorithms are developed; their proven average running times in an n record file are: insertion, O(log(n)); deletion of the root, O(n(k-1)/k); deletion of a random node, O(n); and optimization (guarantees logarithmic performance of searches), O(n(log(n))). Search algorithms are given for partial match queries with t keys specified [proven maximum running time of O(n(k-t)/k)] and for nearest neighbor queries [empirically observed average running time of O(log n).] These performances far surpass the best currently known algorithms for these tasks. An algorithm is presented to handle any general intersection query. The main focus of this paper is theoretical. It is felt, however, that k-d trees could be quite useful in many applications, and examples of potential uses are given
keywords	search, attributes, information, systems, queries, database, intersection, algorithms
series	CADline
last changed	2003/06/02 13:58

_id	8a27
authors	Bentley, Jon L. and Carruthers, Wendy
year	1980
title	Algorithms for Testing the Inclusion of Points in Polygons
source	Allertorn Conference on Communication, Control and Computing (18th : 1980). (10) p. includes bibliography
summary	Determining whether a given point lies inside or outside a simple polygon is an important problem in many applications, including computer vision systems and computer-assisted political redistricting systems. In this paper the authors give algorithms for inclusion problems that are efficient for polygons that are 'close to convex' in a certain precise sense. An empirical study of polygons that arise in several applications shows that typical polygons are indeed 'close to convex,' and a program implementing the algorithm shows that is extremely efficient on point sets of practical sizes
keywords	point inclusion, polygons, algorithms, computational geometry
series	CADline
last changed	2003/06/02 13:58

_id	8060
authors	Bentley, Jon L. and Kernighan, Brian W.
year	1986
title	GRAP - a Language for Typesetting Graphs
source	communications of the ACM. August, 1986. vol. 29: pp. 782-792 : charts. includes bibliography
summary	The authors describe a system that makes it easy and convenient to describe graphs and to include them as an integral part of the document formatting process
keywords	programming, computer graphics, algorithms, business
series	CADline
last changed	2003/06/02 10:24

_id	a619
authors	Bentley, Jon L. and McGeoch, Catherine C.
year	1985
title	Amortized Analyses of Self-Organizing Sequential Search ; Heuristics Programming Techniques and Data Structures
source	communications of the ACM April, 1985. vol. 28: pp. 404-411 : ill. includes bibliography.
summary	Amortization is used to analyze the heuristics in a worst- case sense. The relative merit of the heuristics in this analysis is different in the probabilistic analyses. Experiments show that the behavior of the heuristics on real data is more closely described by the amortized analyses than by the probabilistic analyses
keywords	economics, analysis, search, heuristics
series	CADline
last changed	2003/06/02 13:58

_id	c0ee
authors	Bentley, Jon L. and Ottmann, Thomas
year	1981
title	The Complexity of Manipulating Hierarchically Defined Sets of Rectangles
source	40 p. : ill. Pittsburgh, PA: Department of Computer Science, CMU., April, 1981. CMU-CS-81-109. includes bibliography
summary	Algorithms that manipulate sets of rectangles are of great practical importance in VLSI design systems and other applications. Although much theoretical work has appeared recently on the complexity of rectangle problems, it has assumed that the inputs are given as a list of rectangles. In this paper the authors study the complexity of rectangle problems when the inputs are given in a hierarchical language that allows the designer to build large designs by replicating small designs. They show that while most of the problems are NP-hard in the general case, there are O(N log N) algorithms that process inputs obeying certain restrictions
keywords	rectangles, algorithms, computational geometry, data structures
series	CADline
last changed	2003/06/02 10:24

_id	e671
authors	Bentley, Jon L., Haken, Dorothea and Saxe, James B.
year	1978
title	A General Method for Solving Divide-and-Conquer Recurrences
source	10 p Carnegie Mellon University: December, 1978. includes bibliography.
summary	The complexity of divide-and-conquer algorithms is often described by recurrence relations of the form T(n) = kT(n/c) + f(n). The only method currently available for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note the authors describe a unifying method for solving these recurrences that is both general in applicability and easy to apply without the use of large tables
keywords	recursion, algorithms, divide-and-conquer
series	CADline
last changed	2003/06/02 13:58

_id	6050
authors	Bentley, Jon L.
year	1984
title	Algorithm Design Techniques -- Programming Pearls
source	communications of the ACM. September, 1984. vol. 27: pp. 865-871 : ill
summary	The problem arose in one-dimensional pattern recognition: The input is a vector X of N real numbers; the output is the maximum sum found in any contiguous subvector of the input. The problem is when some of the numbers are negative. This column is built around that problem with an emphasis on the algorithms that solve it and the techniques used to design them
keywords	techniques, programming, algorithms, pattern recognition
series	CADline
last changed	2003/06/02 13:58

_id	6118
authors	Bentley, Jon L.
year	1984
title	Code Tuning -- Programming Pearls
source	communications of the ACM. February, 1984. vol. 27: pp. 91-96
summary	Efficiency is one of many problems in programming, and there are many ways to achieve it. This column is about a low-level approach . 'Code tuning' locates the expensive parts of an existing program and then modifies that code to improve its performance
keywords	programming, search, algorithms, techniques
series	CADline
last changed	2003/06/02 13:58

_id	c159
authors	Bentley, Jon L.
year	1984
title	A Case Study in Applied Algorithm Design
source	IEEE Computer. February, 1984. vol. 17: pp. 75-88 : ill. tables. includes bibliography
summary	In this article the author describes how an algorithm design was used in the development of a small routine in a software system
keywords	algorithms, programming, techniques
series	CADline
last changed	2003/06/02 13:58

_id	4316
authors	Bentley, Jon L.
year	1985
title	Associative Arrays -- Programming Pearls
source	communications of the ACM. June, 1985. vol. 28: pp. 570-576 : ill
summary	Anthropological studies have shown that one's language has a profound effect on one's view of the world. This column is about a language feature outside the Algol heritage: associative arrays. The column examines the associative arrays provided by the AWK language
keywords	techniques, programming, algorithms, data structures
series	CADline
last changed	2003/06/02 13:58

_id	8323
authors	Bentley, Jon L.
year	1985
title	Selection -- Programming Pearls
source	communications of the ACM. November, 1985. vol. 28: pp. 1121- 1127 : ill
summary	This column describes selecting the K- smallest member in a set of N elements. A program for the task is derived and its running time is analyzed
keywords	search, programming, algorithms, techniques
series	CADline
last changed	2003/06/02 13:58

_id	ea6a
authors	Bentley, Jon L.
year	1988
title	More Programming Pearls : Confessions of a Coder
source	207 p. : ill. Reading, Massachusetts: Addison-Wesley Publishing Co., 1988. includes index
summary	A collection of essays demonstrating the various aspects of programming. Some cover programming techniques using the C and AWK languages, other essays discuss making I/O fit for humans and several sub routines
keywords	programming, algorithms, techniques
series	CADline
last changed	2003/06/02 13:58

_id	cdb0
authors	Finkel, R. A. and Bentley, Jon L.
year	1974
title	Quad Trees : A Data Structure for Retrieval on Composite Keys
source	Acta Informatica. 1974. vol. 4: pp. 1-9 : ill. includes bibliography
summary	The quad tree is a data structure appropriate for storing information to be retrieved on composite keys. The paper discusses the specific case of two-dimensional retrieval, although the structure is easily generalized to arbitrary dimensions. Algorithms are given both for straightforward insertion and for a type of balanced insertion into quad trees. Empirical analyses show that the average time for insertion is logarithmic with the tree size. An algorithm for retrieval within regions is presented along with data from empirical studies which imply that searching is reasonably efficient. The paper defines an optimized tree and presents an algorithm to accomplish optimization in n log n time. Searching is guaranteed to be fast in optimized trees. Remaining problems include those of deletion from quad trees and merging of quad trees, which seem to be inherently difficult operations
keywords	quadtree, data structures, algorithms, search, sorting
series	CADline
last changed	2003/06/02 13:58

_id	65c6
authors	Ball, A.A.
year	1975
title	CONSURF Part Two: Description of the Algorithm
source	computer-Aided Design. October, 1975. vol. 7: pp. 237-243 : ill
summary	The paper is the second of a series describing the surface lofting program CONSURF and outlines the algorithm within the program which transform the geometrical input into the mathematical variables of the conic lofting title
keywords	mechanical engineering, lofting, algorithms, curved surfaces
series	CADline
last changed	2003/06/02 13:58

_id	85d7
authors	Braid, I. C.
year	1975
title	The Synthesis of Solids Bounded by Many Faces
source	communications of the ACM. April, 1975. vol. 18: pp. 209-216 : ill. includes bibliography
summary	A technique is presented which allows a class of solid objects to be synthesized and stored using a computer. Synthesis begins with primitive solids like a cube, wedge, or cylinder. Any solid can be moved, scaled, or rotated. Solids may also be added together or subtracted. Two algorithms to perform addition are described. For practical designers, the technique has the advantage that operations are concise, readily composed, and are given in terms of easily imagined solids. Quite short sequences of operations suffice to build up complex solids bounded by many faces
keywords	geometric modeling, algorithms, computer graphics, polyhedra, solids, data structures, boolean operations, Euler operators, B-rep
series	CADline
last changed	2003/06/02 10:24

_id	3aed
authors	Broadbent, G.
year	1975
title	Design in architecture: architecture and the human sciences
source	Wiley J, London
summary	Broadbent first investigates what an architect is as a person. Trying to understand how an architect thinks and what sets him apart from the other members of a building design team. To achieve this Broadbent makes a study of various psychological reports which have been generated about architects. Although it would seem that the reports are inconclusive about what characterizes an architect. In particular there would seem to be a great difference between the personality of average and outstanding architects. Characterizations have been made about personality types in general and they include, creative and non-creative, tolerant and prejudiced, introverted and extroverted. Many of these terms carry linguistic connotations which are perhaps misleading. One of the less emotionally loaded distinctions is between cyclothymes and schizothymes. Cyclothymes seem to be sensitive and sociable people with good verbal reasoning skills. By contrast the schizothymes dissociate intellectual and emotional aspects of life tending towards self-sufficiency, reserve and intolerance. Some outstanding designers have been characterized as the latter, whereas some studies would favour the former characteristics for average architects. Although there does not appear to be a clear definition of the character of an architect, some interesting distinctions between broad types of thinkers can be identified. One classification is between convergent and divergent thinkers. The difference between convergent and divergent thinkers re-occurs throughout the book. Convergent thinkers are generally associated with the sciences, and will work effectively towards one correct answer to a given problem. Divergent thinkers respond well to open-ended questions, taking pleasure from the task of proposing many alternatives to a given problem. Divergent thinkers seem to enjoy ambiguity in a problem and are happy to work in this situation, convergent thinkers prefer precise problem definitions avoiding "messy" situations. Convergent thinkers seek to find an abstract perfection, through precise logical arguments, something which divergent thinkers mistrust. Although all architects will fall somewhere between these two extremes, as with all the polarizations presented, there are examples of successful architects who show tendencies to either one of these types of thinking. It has been suggested that successful designing requires both types of thinking. The creative process described in simple terms relies upon the creation of a set of possible solutions and a critical selection process to choose the most suitable. Divergent thinking works best at producing alternatives, and convergent thinking works best at selecting the best solution from a given set. The divergent thinker works within a vague framework, while the convergent thinker works within the well-defined set of possibilities presented.
series	other
last changed	2003/04/23 15:14

_id	2b3c
authors	Carrara, G. and Novembri, G.
year	1986
title	KAAD - Knowledge-based Assistance for Architectural Design
doi	https://doi.org/10.52842/conf.ecaade.1986.202
source	Teaching and Research Experience with CAAD [4th eCAADe Conference Proceedings] Rome (Italy) 11-13 September 1986, pp. 202-212
summary	The research being conducted at the CABD LAB at the Department of Building and Environmental Control Technologies is geared to the production of an Expert System for architectural design, which is able to perform interactive design tasks and help to provide accurate and complete description of the buildings in question. The Expert System will control the design process, continually ensuring consistency between the definitions of the designer and a given set of constraints. Accordingly, the System will be able to determine the effects of of definition, performing the choices taken at different stages necessary calculations and checks. The System is based on a general representation of the building objects, from individual components to the whole building defined in terms of a number of hierarchical, topological and functional relational structures resulting from earlier research conducted into the automatic management of architectural design since 1975.
series	eCAADe
last changed	2022/06/07 07:54

_id	sigradi2006_e183a
id	sigradi2006_e183a
authors	Costa Couceiro, Mauro
year	2006
title	La Arquitectura como Extensión Fenotípica Humana - Un Acercamiento Basado en Análisis Computacionales [Architecture as human phenotypic extension – An approach based on computational explorations]
source	SIGraDi 2006 - [Proceedings of the 10th Iberoamerican Congress of Digital Graphics] Santiago de Chile - Chile 21-23 November 2006, pp. 56-60
summary	The study describes some of the aspects tackled within a current Ph.D. research where architectural applications of constructive, structural and organization processes existing in biological systems are considered. The present information processing capacity of computers and the specific software development have allowed creating a bridge between two holistic nature disciplines: architecture and biology. The crossover between those disciplines entails a methodological paradigm change towards a new one based on the dynamical aspects of forms and compositions. Recent studies about artificial-natural intelligence (Hawkins, 2004) and developmental-evolutionary biology (Maturana, 2004) have added fundamental knowledge about the role of the analogy in the creative process and the relationship between forms and functions. The dimensions and restrictions of the Evo-Devo concepts are analyzed, developed and tested by software that combines parametric geometries, L-systems (Lindenmayer, 1990), shape-grammars (Stiny and Gips, 1971) and evolutionary algorithms (Holland, 1975) as a way of testing new architectural solutions within computable environments. It is pondered Lamarck´s (1744-1829) and Weismann (1834-1914) theoretical approaches to evolution where can be found significant opposing views. Lamarck´s theory assumes that an individual effort towards a specific evolutionary goal can cause change to descendents. On the other hand, Weismann defended that the germ cells are not affected by anything the body learns or any ability it acquires during its life, and cannot pass this information on to the next generation; this is called the Weismann barrier. Lamarck’s widely rejected theory has recently found a new place in artificial and natural intelligence researches as a valid explanation to some aspects of the human knowledge evolution phenomena, that is, the deliberate change of paradigms in the intentional research of solutions. As well as the analogy between genetics and architecture (Estévez and Shu, 2000) is useful in order to understand and program emergent complexity phenomena (Hopfield, 1982) for architectural solutions, also the consideration of architecture as a product of a human extended phenotype can help us to understand better its cultural dimension.
keywords	evolutionary computation; genetic architectures; artificial/natural intelligence
series	SIGRADI
email
last changed	2016/03/10 09:49

_id	b37b
id	b37b
authors	Gero, J. S.
year	1975
title	Ethics in computer-aided design: A polemic
source	ACM SIGDA Newsletter, 5(4): 9-14
summary	It is one of the difficulties of the scientific approach to problem solving that the variables need to be defined at the beginning of the investigation. This i s further exacerbated when computer based techniques are applied because of the need to define variables explicitly . Current problem solving is directed to handling only well defined problems in which certain variables are assumed to be exogenous - the educational system schools people in methods for manipulating problems at this level. It appears that computer-aided design systems, in general, have not been able to incorporate any adequate value systems within them nor have they been able to provide a means of examining the problem in an ethos borader than' the one defined at the outset. Both of these difficulties are considered within the ambit of ethics. It is suggested that subjective value systems can be easily incorporated with the use of interactive computing but that the 'ethics of the whole system' present a thornier problem.
series	other
type	normal paper
email
more	http://www.arch.usyd.edu.au/~john/
last changed	2006/05/27 18:43

_id	06e1
authors	Keul, Alexander
year	1996
title	LOST IN SPACE? ARCHITECTURAL PSYCHOLOGY - PAST, PRESENT, FUTURE
source	Full-Scale Modeling in the Age of Virtual Reality [6th EFA-Conference Proceedings]
summary	A methodological review by Kaminski (1995) summed up five perspectives in environmental psychology - patterns of spatial distribution, everyday “jigsaw puzzles”, functional everyday action systems, sociocultural change and evolution of competence. Architectural psychology (named so at the Strathclyde conference 1969; Canter, 1973) as psychology of built environments is one leg of environmental psychology, the second one being psychology of environmental protection. Architectural psychology has come of age and passed its 25th birthday. Thus, a triangulation of its position, especially in Central Europe, seems interesting and necessary. A recent survey mainly on university projects in German-speaking countries (Kruse & Trimpin, 1995) found a marked decrease of studies in psychology of built environments. 1994, 25% of all projects were reported in this category, which in 1975 had made up 40% (Kruse, 1975). Guenther, in an unpublished survey of BDP (association of professional German psychologists) members, encountered only a handful active in architectural psychology - mostly part-time, not full-time. 1996, Austria has two full-time university specialists. The discrepancy between the general interest displayed by planners and a still low institutionalization is noticeable. How is the research situation? Using several standard research data banks, the author collected articles and book(chapter)s on architectural psychology in German- and English-language countries from 1990 to 1996. Studies on main architecture-psychology interface problems such as user needs, housing quality evaluations, participatory planning and spatial simulation / virtual reality did not outline an “old, settled” discipline, but rather the sketchy, random surface of a field “always starting anew”. E.g., discussions at the 1995 EAEA-Conference showed that several architectural simulation studies since 1973 caused no major impact on planner's opinions (Keul&Martens, 1996). “Re-inventions of the wheel” are caused by a lack of meetings (except this one!) and of interdisciplinary infrastructure in German-language countries (contrary to Sweden or the United States). Social pressures building up on architecture nowadays by inter-European competition, budget cuts and citizen activities for informed consent in most urban projects are a new challenge for planners to cooperate efficiently with social scientists. At Salzburg, the author currently manages the Corporate Design-process for the Chamber of Architecture, Division for Upper Austria and Salzburg. A “working group for architectural psychology” (Keul-Martens-Maderthaner) has been active since 1994.
keywords	Model Simulation, Real Environments
series	EAEA
type	normal paper
email
more	http://info.tuwien.ac.at/efa/
last changed	2005/09/09 10:43

For more results click below: