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

_id a7c1
authors Galle, Per
year 1987
title A Basic Problem Definition Language for Automated Floor Plan Design
source 113 p. 1987. DIKU Research Report No. 87/4
summary CADLINE has abstract only. Algorithms for automated floor plan design need a machine- readable description of properties of the desired floor plans. In this report BPDL ('Basic Problem Definition Language'), a rudimentary language for stating such descriptions, is developed. The development is based on a discussion of pragmatic aspects of possible features of the language. The resulting language is described by formal definitions of syntax and semantics, accompanied by informal explanations. Finally, experiments with a floor plan design algorithm that supports BPDL are reported and it is concluded that even a rudimentary language like BPDL can describe relatively non- trivial floor plan layouts, provided a set of geometrical primitives, attributes and relations that make up the language are carefully chosen. Further research along the lines of BPDL is suggested, and the importance of a systematic approach to development of future specification languages for architectural design is stressed
keywords architecture, floor plans, design, attributes, relations, semantics, algorithms, synthesis, planning, languages
series CADline
last changed 1999/02/12 14:08

_id 801f
authors Galle, Per
year 1987
title Branch & Sample : Systematic Combinatorial Search without Optimization
source 73 p. 1987. DIKU Research Report No. 87/5. CADLINE has abstract only
summary Many constraint satisfaction problems are combinatorically explosive, i.e. have far too many solutions. Optimization techniques may help in selecting solutions for consideration, but a reasonable measure of optimality is not always at hand. The branch & sample algorithm is presented as an alternative to optimization. If the constraints themselves limit the solution set sufficiently, the algorithm finds all solutions, but otherwise a suitable number of solutions (determined by the user) is generated, such that each new solution has a maximal distance to those already generated. The distance measure used is a so called ultrametric distance expressible in terms of the search tree: solutions are viewed as m-tuples of fixed length, each of whose m decision variables corresponds to a level in the search tree. The distance between two solutions is the number of edges from their leaf nodes to the closest common predecessor node in the tree. For problems whose decision variables depend on each other (as is often the case) the set of solutions generated in this way corresponds well to the intuitive notion of a 'representative sample.' The principles of Branch & Sample are first introduced informally, then the algorithm is developed by stepwise refinement, and two examples of its use are given. A fully tested application-independent implementation of the algorithm in C is given as an appendix
keywords algorithms, combinatorics, search, constraints, floor plans, layout, synthesis, architecture
series CADline
last changed 1999/02/12 14:08

_id c7e0
id c7e0
authors Maria Gabriela Caffarena Celani
year 2002
title BEYOND ANALYSIS AND REPRESENTATION IN CAD: A NEW COMPUTATIONAL APPROACH TO DESIGN EDUCATION
source Submitted to the Department of Architecture in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the field of Architecture: Design & Computation at the Massachusetts Institute of Technology
summary This thesis aims at changing students' attitude towards the use of computer-aided design (CAD) in architecture. It starts from the premise that CAD is used mostly for analysis and representation, and not as a real design aide, and that architecture students have a bias against learning computer programming. For this purpose, a prototypical instruction system that mixes computer-aided design and computational design theory was developed, based on a series of fundamental concepts that are common to both fields. This system was influenced by Mitchell's (1987) The Art of Computer Graphics Programming and Stiny's (1976) shape grammars. Despite being based on solid theoretical foundations, CAD has progressively become an exclusively practical tool, since its origins in the 50's and 60's, while computational design theories have been mostly restricted to the academic circles. This thesis proposes an inversion in the present situation: the study of CAD theory, and the application of computational design into practice. The system proposed provides a conceptual framework that can be adapted to different circumstances, including course formats and resources, as well as students' background and technical training. It is based on seven fundamental concepts from computational design theories that are also important to the study of shape grammars: symmetry, recursion, rule-based compositions, parameterization of shapes, generative systems, algorithmization of design procedures, and shape emergence. These concepts are introduced within a CAD context, where their practical implementation and experimentation are possible, focusing the understanding of the computational nature of design. During this research, the proposed system was tested in two case studies with students from schools that had contrary orientations in terms of the importance of CAD in the architectural curriculum. In these experimental courses, students' activities evolved from using a commercial CAD tool in an innovative way, to the use of programming techniques for creating meaningful tools. Despite not having a statistical reach, the fieldwork allowed drawing preliminary conclusions about the proposed system's efficacy, since virtually all the students reported changing their understanding of the role of CAD in architecture, while some also acknowledged a conceptual influence in other subjects and in the way they see architecture.
keywords Symmetry
series thesis:PhD
type normal paper
email celani@fec.unicamp.br
more http://www.fec.unicamp.br/~celani/
last changed 2004/11/17 19:51

No more hits.

HOMELOGIN (you are user _anon_352324 from group guest) CUMINCAD Papers Powered by SciX Open Publishing Services 1.002