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

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

_id	7e68
authors	Holland, J.
year	1992
title	Genetic Algorithms
source	Scientific America, July 1992
summary	Living organisms are consummate problem solvers. They exhibit a versatility that puts the best computer programs to shame. This observation is especially galling for computer scientists, who may spend months or years of intellectual effort on an algorithm, whereas organisms come by their abilities through the apparently undirected mechanism of evolution and natural selection. Pragmatic researchers see evolution's remarkable power as something to be emulated rather than envied. Natural selection eliminates one of the greatest hurdles in software design: specifying in advance all the features of a problem and the actions a program should take to deal with them. By harnessing the mechanisms of evolution, researchers may be able to "breed" programs that solve problems even when no person can fully understand their structure. Indeed, these so-called genetic algorithms have already demonstrated the ability to made breakthroughs in the design of such complex systems as jet engines. Genetic algorithms make it possible to explore a far greater range of potential solutions to a problem than do conventional programs. Furthermore, as researchers probe the natural selection of programs under controlled an well-understood conditions, the practical results they achieve may yield some insight into the details of how life and intelligence evolve in the natural world.
series	journal paper
last changed	2003/04/23 15:50

_id	sigradi2015_11.166
id	sigradi2015_11.166
authors	Calixto, Victor; Celani, Gabriela
year	2015
title	A literature review for space planning optimization using an evolutionary algorithm approach: 1992-2014
source	SIGRADI 2015 [Proceedings of the 19th Conference of the Iberoamerican Society of Digital Graphics - vol. 2 - ISBN: 978-85-8039-133-6] Florianópolis, SC, Brasil 23-27 November 2015, pp. 662-671.
summary	Space planning in architecture is a field of research in which the process of arranging a set of space elements is the main concern. This paper presents a survey of 31 papers among applications and reviews of space planning method using evolutionary algorithms. The objective of this work was to organize, classify and discuss about twenty-two years of SP based on an evolutionary approach to orient future research in the field.
keywords	Space Planning, Evolutionary algorithms, Generative System
series	SIGRADI
email
last changed	2016/03/10 09:47

_id	d919
authors	Heckbert, P.S.
year	1992
title	Discontinuity Meshing for Radiosity
source	Eurographics Workshop on Rendering. May 1992, pp. 203-216
summary	The radiosity method is the most popular algorithm for simulating interreflection of light between diffuse surfaces. Most existing radiosity algorithms employ simple meshes and piecewise constant approximations, thereby constraining the radiosity function to be constant across each polygonal element. Much more accurate simulations are possible if linear, quadratic, or higher degree approximations are used. In order to realize the potential accuracy of higher-degree approximations, however, it is necessary for the radiosity mesh to resolve discontinuities such as shadow edges in the radiosity function. A discontinuity meshing algorithm is presented that places mesh boundaries directly along discontinuities. Such algorithms offer the potential of faster, more accurate simulations. Results are shown for three-dimensional scenes.
series	other
last changed	2003/04/23 15:14

_id	8488
authors	Liggett, Robin S.
year	1992
title	A Designer-Automated Algorithm Partnership : An Interactive Graphic Approach to Facility Layout
source	New York: John Wiley & Sons, 1992. pp. 101-123 : ill. includes bibliography
summary	Automated solution technique for spatial allocation problems have long been an interest of researchers in computer-aided design. This paper describes research focusing on the use of an interactive graphic interface for the solution of facility layout problems which have quantifyable but sometimes competing criteria. The ideas presented in the paper have been implemented in a personal computer system
keywords	algorithms, user interface, layout, synthesis, floor plans, architecture, facilities planning, automation, space allocation, optimization
series	CADline
email
last changed	2003/06/02 13:58

_id	f1f2
authors	Watt, Alan
year	1992
title	Advanced animation and rendering techniques
source	New York: ACM Press
summary	This book is an exposition of state-of-the-art techniques in rendering and animation. It provides a unique synthesis of techniques and theory. Four sections describe: Basics, Theoretical Foundations, Advanced Rendering Techniques, and Advanced Animation Techniques. Each technique is illustrated with a series of full color frames showing the development of the example. Many code examples and some complete implementations are given in C for interesting and advanced algorithms such as soft shadows and marching cubes.
series	other
last changed	2003/04/23 15:14

_id	a3f5
authors	Zandi-Nia, Abolfazl
year	1992
title	Topgene: An artificial Intelligence Approach to a Design Process
source	Delft University of Technology
summary	This work deals with two architectural design (AD) problems at the topological level and in presence of the social norms community, privacy, circulation-cost, and intervening opportunity. The first problem concerns generating a design with respect to a set of above mentioned norms, and the second problem requires evaluation of existing designs with respect to the same set of norms. Both problems are based on the structural-behavioral relationship in buildings. This work has challenged above problems in the following senses: (1) A working system, called TOPGENE (The TOpological Pattern GENErator) has been developed. (2) Both problems may be vague and may lack enough information in their statement. For example, an AD in the presence of the social norms requires the degrees of interactions between the location pairs in the building. This information is not always implicitly available, and must be explicated from the design data. (3) An AD problem at topological level is intractable with no fast and efficient algorithm for its solution. To reduce the search efforts in the process of design generation, TOPGENE uses a heuristic hill climbing strategy that takes advantage of domain specific rules of thumbs to choose a path in the search space of a design. (4) TOPGENE uses the Q-analysis method for explication of hidden information, also hierarchical clustering of location-pairs with respect to their flow generation potential as a prerequisite information for the heuristic reasoning process. (5) To deal with a design of a building at topological level TOPGENE takes advantage of existing graph algorithms such as path-finding and planarity testing during its reasoning process. This work also presents a new efficient algorithm for keeping track of distances in a growing graph. (6) This work also presents a neural net implementation of a special case of the design generation problem. This approach is based on the Hopfield model of neural networks. The result of this approach has been used test TOPGENE approach in generating designs. A comparison of these two approaches shows that the neural network provides mathematically more optimal designs, while TOPGENE produces more realistic designs. These two systems may be integrated to create a hybrid system.
series	thesis:PhD
last changed	2003/02/12 22:37

No more hits.