An optimized placement of building drawings with moving least squares and K-means clustering

被引:2
作者
Kim, Jong-Hyun [1 ]
Lee, Jung [2 ]
机构
[1] Kangnam Univ, Dept Software Applicat, Yongin, Gyeonggi, South Korea
[2] Hallym Univ, Dept Convergence Software, Chunchon, Gangwon, South Korea
基金
新加坡国家研究基金会;
关键词
Moving least squares; K-means clustering; Arrangement of building drawings; Architectural design; POLYGON CONTAINMENT; PARALLEL FRAMEWORK; PACKING;
D O I
10.1007/s11042-018-6683-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a method that can efficiently process the arrangement of building drawings using K-means clustering and vector field constructed by optimized moving least squares (MLS). In the proposed framework, after selecting the area to actually place the buildings, the vector field is generated by optimizing the MLS based on this area, and the angle to rotate the building drawing is determined based on this field. In the simulation step, K-means clustering is used to determine the initial layout of the building drawings, and their locations are advected based on the vector field calculated by MLS to further locate new building drawings in the empty space. This allows a maximum number of building plans to be placed within a given area. The practicality of the proposed method was verified by comparing with the actual architectural design, and the efficiency of the overall design process was improved by greatly reducing the amount of time and work required.
引用
收藏
页码:11719 / 11734
页数:16
相关论文
共 26 条
[1]  
AKINCI N, VIRTUAL, V24, P195, DOI DOI 10.1002/CAV.1499
[2]  
Avnaim F., 1988, STACS 88. 5th Annual Symposium on Theoretical Aspects of Computer Science. Proceedings, P322, DOI 10.1007/BFb0035856
[3]  
Avnaim Francis., 1987, P 3 ACM S COMPUTATIO, P242, DOI DOI 10.1145/41958.41984
[4]   POLYGON CONTAINMENT UNDER TRANSLATION [J].
BAKER, BS ;
FORTUNE, SJ ;
MAHANEY, SR .
JOURNAL OF ALGORITHMS, 1986, 7 (04) :532-548
[5]   Digital mosaic frameworks - An overview [J].
Battiato, S. ;
Di Blasi, G. ;
Farinella, G. M. ;
Gallo, G. .
COMPUTER GRAPHICS FORUM, 2007, 26 (04) :794-812
[6]  
Battiato S., 2013, J ELECT COMPUT ENG, V2013, P8
[7]   A tutorial in irregular shape packing problems [J].
Bennell, J. A. ;
Oliveira, J. F. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 :S93-S105
[8]   SOLUTION APPROACHES TO IRREGULAR NESTING PROBLEMS [J].
DOWSLAND, KA ;
DOWSLAND, WB .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 84 (03) :506-521
[9]   Orthogonal self-guided similarity preserving projection for classification and clustering [J].
Fang, Xiaozhao ;
Xu, Yong ;
Li, Xuelong ;
Lai, Zhihui ;
Teng, Shaohua ;
Fei, Lunke .
NEURAL NETWORKS, 2017, 88 :1-8
[10]   Robust Semi-Supervised Subspace Clustering via Non-Negative Low-Rank Representation [J].
Fang, Xiaozhao ;
Xu, Yong ;
Li, Xuelong ;
Lai, Zhihui ;
Wong, Wai Keung .
IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (08) :1828-1838