基于内部可行域的住区建筑物自动布局算法  

An Automatic Building-layout Algorithm Based on Inner Available Region

作　　者：凌玲[1] 王晓博[1] 李成刚[1] 

机构地区：[1]华中科技大学机械科学与工程学院,湖北武汉430074

出　　处：《计算机技术与发展》2013年第8期1-4,8,共5页Computer Technology and Development

基　　金：中央高校基本科研业务费专项资金资助项目(2011QN126)

摘　　要：为了实现住区建筑物自动布局设计,文中根据住区建筑物布局设计时需要考虑的日照、消防等约束,构造了建筑物布局的数学模型,借鉴正交矩形布局问题的相关算法和临界多边形的计算方法,实现了单类型建筑物的行列式和周边式自动快速布局方法。文中提出了建筑物实际占地区域相对于规划建筑用地的内部可行域算法,结合内部可行域方法得出边界条件,采用砌砖式算法进行快速行列式布局,由内部可行域边界组成布局路径,进行快速周边式布局。文中最后通过算例展示了方法的实现结果,验证了该方法的可行性。In order to implement the automation in the building-layout, an efficient method for automatic layout of buildings in the planned area has been proposed, which takes sunshine time and the fit-e space between buildings into account. It could arrange buildings on the style of determinant arrangement and peripheral arrangement,referring to the algorithms for the orthogonal rectangular packing prob- lem and the algorithms for the no-fit polygon. Proposed an algorithm of calculating the inner available region for one polygon which stands for the building-covered region with respect to another polygon which stands for the planned area. Then ,the determinant arrange- ment buildings were arranged by the bricklaying algorithm in the inner available region and the peripheral arrangement buildings were ar- ranged along the boundary of the inner available region. At the end, some examples were presented to verify the method.

关 键 词：布局问题 内部可行域 行列式布局 周边式布局 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]