Algorithm for constructing an optimally connected rectangular floor plan
In most applications, such as urbanism and architecture, randomly utilizing given spaces is certainly not favorable. This study proposes an explicit algorithm for utilizing the given spaces inside a rectangle with satisfactory results. In the literature, connectivity is not considered as a criterion...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
KeAi Communications Co., Ltd.
2014-09-01
|
Series: | Frontiers of Architectural Research |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2095263514000375 |
id |
doaj-b7651d0755c549f9b36180437205709b |
---|---|
record_format |
Article |
spelling |
doaj-b7651d0755c549f9b36180437205709b2021-03-02T10:52:52ZengKeAi Communications Co., Ltd.Frontiers of Architectural Research2095-26352014-09-013332433010.1016/j.foar.2013.12.003Algorithm for constructing an optimally connected rectangular floor planKrishnendra ShekhawatIn most applications, such as urbanism and architecture, randomly utilizing given spaces is certainly not favorable. This study proposes an explicit algorithm for utilizing the given spaces inside a rectangle with satisfactory results. In the literature, connectivity is not considered as a criterion for floor plan design, but it is deemed essential in architecture. For example, dining rooms are preferably connected to kitchens, toilets should be connected to many rooms, and each bedroom should be separated from the other rooms. This paper describes adjacency among spaces and proves that the obtained rectangular floor plan is one of the best ones in terms of connectivity. An architectural and mathematical object called extra spaces is introduced by the proposed algorithm and is subsequently examined in this work.http://www.sciencedirect.com/science/article/pii/S2095263514000375Floor planExtra spaceAlgorithmAdjacency |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Krishnendra Shekhawat |
spellingShingle |
Krishnendra Shekhawat Algorithm for constructing an optimally connected rectangular floor plan Frontiers of Architectural Research Floor plan Extra space Algorithm Adjacency |
author_facet |
Krishnendra Shekhawat |
author_sort |
Krishnendra Shekhawat |
title |
Algorithm for constructing an optimally connected rectangular floor plan |
title_short |
Algorithm for constructing an optimally connected rectangular floor plan |
title_full |
Algorithm for constructing an optimally connected rectangular floor plan |
title_fullStr |
Algorithm for constructing an optimally connected rectangular floor plan |
title_full_unstemmed |
Algorithm for constructing an optimally connected rectangular floor plan |
title_sort |
algorithm for constructing an optimally connected rectangular floor plan |
publisher |
KeAi Communications Co., Ltd. |
series |
Frontiers of Architectural Research |
issn |
2095-2635 |
publishDate |
2014-09-01 |
description |
In most applications, such as urbanism and architecture, randomly utilizing given spaces is certainly not favorable. This study proposes an explicit algorithm for utilizing the given spaces inside a rectangle with satisfactory results. In the literature, connectivity is not considered as a criterion for floor plan design, but it is deemed essential in architecture. For example, dining rooms are preferably connected to kitchens, toilets should be connected to many rooms, and each bedroom should be separated from the other rooms. This paper describes adjacency among spaces and proves that the obtained rectangular floor plan is one of the best ones in terms of connectivity. An architectural and mathematical object called extra spaces is introduced by the proposed algorithm and is subsequently examined in this work. |
topic |
Floor plan Extra space Algorithm Adjacency |
url |
http://www.sciencedirect.com/science/article/pii/S2095263514000375 |
work_keys_str_mv |
AT krishnendrashekhawat algorithmforconstructinganoptimallyconnectedrectangularfloorplan |
_version_ |
1724236023440867328 |