| id |
cf2017_044 |
| authors |
Shekhawat, Krishnendra; Duarte, Jose P. |
| year |
2017 |
| title |
Rectilinear Floor Plans |
| source |
Gülen Çagdas, Mine Özkar, Leman F. Gül and Ethem Gürer (Eds.) Future Trajectories of Computation in Design [17th International Conference, CAAD Futures 2017, Proceedings / ISBN 978-975-561-482-3] Istanbul, Turkey, July 12-14, 2017, p. 44. |
| summary |
This work aims at providing a mathematical approach to the problem of allocating given rooms within a given predefined contour shape, while satisfying given adjacency and size constraints. This work is significant with respect to complex building structures, such as hospitals, schools, offices, etc., where we may require floor plans other than rectangular ones and adjacency constraints are defined by the frequency of journeys expected to be made by occupants of the building along different routes. In this paper, we present an algorithmic approach using graph theoretical tools for generating rectilinear floor plan layouts, while satisfying adjacency and size constraints. |
| keywords |
Adjacency graph, Algorithm, Architectural design, Dual graph, Orthogonal floor plan |
| series |
CAAD Futures |
| email |
|
| full text |
 file.pdf (206,327 bytes) |
| references |
Content-type: text/plain
|
| last changed |
2017/12/01 14:37 |
|
