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

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

_id	08a1
authors	Balachandran, M.B. and Gero, John S.
year	1987
title	A Knowledge-based Graphical Interface for Structural Design
source	Southampton: CM Publications, 1987. pp. 335-346
summary	This paper describes a knowledge-based graphical interface for the domain of structural engineering. The key aspects of the system include graphics interpretation, feature extraction of graphic objects and the identification of the entity itself. Details of the implementation of a prototype system using Prolog and C are provided. The domain knowledge is represented as frames. Examples are given to illustrate the performance of the system
keywords	structures, user interface, knowledge base, systems, design, engineering, computer graphics, frames
series	CADline
email
last changed	2003/06/02 13:58

_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 15:08

_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 15:08

_id	2ac0
authors	Galle, Per
year	1987
title	A Formalized Concept of Sketching in Automated Floor Plan Design
source	177 p. 1987. DIKO Research Report No.87/3
summary	CADLINE has abstract only. Automated floor plan design, though originally motivated by the difficulties encountered by architects manually designing building layouts, raise several questions that may be of relevance to related application areas as well. e.g. design of electronic circuitry. One such question is, 'how do we come from a given set of constraints on size and placement of rooms (components) to a set of floor plans (circuit layouts) that satisfy these constraints?' In manual architectural design, sketches are used as an intermediate step. The present work is a study of a number of formalizations of the sketch concept which have been or could be used in computer- generation of architectural floor plans. A particular type of sketch, called the 'delta-derivative', is suggested and developed. The delta-derivative of a desired solution plan is an approximation of that solution plan and usually several other similar or 'equivalent' solutions. The idea is to generate sketches ('abstract' plans) before solutions ('concrete' plans), because they are simpler to compute, weeding out sketches that are not 'promising', and trying to refine the remaining sketches into solutions proper, thus limiting the amount of combinatorial search. Several abstraction levels of sketches may be used in this process. However, constraints as specified by the user of an automated design system are assumed to apply to the solutions; therefore a major theoretical problem which is addressed in the report is the derivation of sketch-level constraints that define which sketches to be generated. A comprehensive floor plan design system based on these ideas has been implemented, and empirical results are reported which confirms certain predicted advantages of delta-derivatives but also shows that the sketch-level constraints based on the developed theory are too weak if used alone; they allow generation of too many sketches which cannot possibly be refined into solutions. The report finally conjectures a solution to this problem
keywords	CAD, planning, architecture, floor plans, design, combinatorics, programming, abstraction
series	CADline
last changed	1999/02/12 15:08

_id	861a
authors	Sedas, Sergio W. and Talukdar, Sarosh N.
year	1987
title	A Disassembly Planner for Redesign
source	The Winter Annual Meeting of the American Society of Mechanical Engineers. Symposium of Intelligent and Integrated Manufacturing Analysis and Synthesis. December, 1987. Pittsburgh, PA: Engineering Design Research Center, CMU, 1988. [6] p. : ill. includes bibliography
summary	This paper describes an algorithm for generating plans for disassembling given objects. The plans are produced by a set of knowledge sources acting on a set of representations for the object. Both sets are arbitrarily expandable, so programs using the approach can grow continually in capability. Our present complement of knowledge sources and representations can tackle relatively difficult problems. Three examples are included. The first requires a good bit of geometric reasoning before appropriate subassemblies can be selected. The second and third require certain movable parts to be repositioned before disassembly can be achieved
keywords	algorithms, representation, synthesis, assemblies, knowledge, reasoning, mechanical engineering
series	CADline
last changed	2003/06/02 13:58

No more hits.