返回
Enumerating generic rectangular floor plans
DOI:10.1016/j.autcon.2018.03.037.png)
摘要
En 中文
A rectangular floor plan (RFP) is a floor plan in which plan's boundary and each room is a rectangle. The problem is to construct a RFP for the given adjacency requirements, if it exists. In this paper, we aim to present a generic solution to the above problem by enumerating a set of RFP that topologically contain all possible RFP. This set of RFP is called generic rectangular floor plans (GRFP). Furthermore, the construction of GRFP leads us to the necessary condition for the existence of a RFP corresponding to a given graph.
Keyword:
Adjacency
Architectural design
Dual graph
Graph theory
Algorithm
Floor plan
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.5
论文数:
6.3K
被引数:
4.2W

