A platform for research: civil engineering, architecture and urbanism
Abstract For some projects an appropriate optimal design strategy is to minimise functional clashes by dealing first with the most highly interacting design requirements. A graph is formed from a list of requirements and the links between them. Graph theory algorithms are given for reducing the graph to a set of clusters, then reassembling them in hierarchical order as a guide for design. Examples are given for layout generation, and an extension is proposed for general systems.
Abstract For some projects an appropriate optimal design strategy is to minimise functional clashes by dealing first with the most highly interacting design requirements. A graph is formed from a list of requirements and the links between them. Graph theory algorithms are given for reducing the graph to a set of clusters, then reassembling them in hierarchical order as a guide for design. Examples are given for layout generation, and an extension is proposed for general systems.
Network Structuring Algorithms
Elms, D. G. (author)
1992-01-01
18 pages
Article/Chapter (Book)
Electronic Resource
English
2.1 Surface Structuring: Structuring, Polishing, and Etching
Trans Tech Publications | 2000
|Particle network re-structuring in highly-concentrated ceramic suspensions
British Library Online Contents | 2000
|Structuring Design Information
Taylor & Francis Verlag | 1974
|Online Contents | 1994