STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN
- 1 January 1979
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 4 (1) , 15-36
- https://doi.org/10.1080/03052157908902401
Abstract
Buildings contain enormously complex configurations of corridors, pipes, ducts, conduits and related building system components. In many cases, the configuration and analysis of these component systems can be Formulated as the Steiner tree problem with and without obstacles. Certain building systems can be represented with a Euclidean metric while others are best defined with a rectilinear (Manhattan) metric. The paper describes heuristic algorithms for the interactive development of minimal Steiner trees and circuits. The interactive approach enables architects and engineers to design these systems in ways consistent with the designed arrangement of building activities in two and three dimensions.Keywords
This publication has 15 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- The Complexity of Computing Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1977
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Rectilinear steiner trees: Efficient special-case algorithmsNetworks, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966