Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Akinci N, Cornelis J, Akinci G, Teschner M (2013) Coupling elastic solids with smoothed particle hydrodynamics fluids. Comput Anim Virtual Worlds 24 (3-4):195–203
Avnaim F, Bsissonnat J (1987) Simultaneous containment of several polygons. In: Proceedings of the third annual symposium on computational geometry, pp 242–247
Avnaim F, Boissonnat JD (1988) Polygon placement under translation and rotation. In: Annual symposium on theoretical aspects of computer science, pp 322–333
Baker BS, Fortune S, Mahaney SR (1986) Polygon containment under translation. J Algorithms 7(4):532–548
Battiato S, Di Blasi G, Farinella GM, Gallo G (2007) Digital mosaic frameworks-an overview. Comput Graphics Forum 26(4):794–812
Battiato S, Milone A, Puglisi G (2013) Artificial mosaic generation with gradient vector flow and tile cutting. J Electr Comput Eng 2013:8
Bennell JA, Oliveira JF (2009) A tutorial in irregular shape packing problems. J Oper Res Soc 60(1):S93–S105
Dowsland KA, Dowsland WB (1995) Solution approaches to irregular nesting problems. Eur J Oper Res 84(3):506–521
Fang X, Xu Y, Li X, Lai Z, Wong WK (2016) Robust semi-supervised subspace clustering via non-negative low-rank representation. IEEE Trans Cybern 46 (8):1828–1838
Fang X, Xu Y, Li X, Lai Z, Teng S, Fei L (2017) Orthogonal self-guided similarity preserving projection for classification and clustering. Neural Netw 88:1–8
Fowler RJ, Paterson MS, Tanimoto SL (1981) Optimal packing and covering in the plane are NP-complete. Inf Process Lett 12(3):133–137
Grinde RB, Cavalier TM (1996) Containment of a single polygon using mathematical programming. Eur J Oper Res 92(2):368–386
Grinde RB, Cavalier TM (1997) A new algorithm for the two-polygon containment problem. Comput Oper Res 24(3):231–251
Hausner A (2001) Simulating decorative mosaics. In: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, pp 573–580
Liu Y, Veksler O, Juan O (2010) Generating classic mosaics with graph cuts. Comput Graphics Forum 29(8):2387–2399
Martin R, Stephenson P (1988) Putting objects into boxes. Comput Aided Des 20(9):506–514
Milenkovic V (1997) Multiple translational containment part ii: exact algorithms. Algorithmica 19(1–2):183–218
Milenkovic VJ (1998) Rotational polygon overlap minimization and compaction. Comput Geom 10(4):305–318
Milenkovic VJ (1999) Rotational polygon containment and minimum enclosure using only robust 2d constructions. Comput Geom 13(1):3–19
Müller M, Charypar D, Gross M (2003) Particle-based fluid simulation for interactive applications. In: ACM SIGGRAPH/eurographics symposium on computer animation, pp 154–159
Puglisi G, Battiato S (2013) Artificial mosaic generation. In: Image and video-based artistic stylisation, pp 189–209
Yan C, Zhang Y, Xu J, Dai F, Li L, Dai Q, Wu F (2014) A highly parallel framework for hevc coding unit partitioning tree decision on many-core processors. IEEE Signal Process Lett 21(5):573–576
Yan C, Zhang Y, Xu J, Dai F, Zhang J, Dai Q, Wu F (2014) Efficient parallel framework for hevc motion estimation on many-core processors. IEEE Trans Circuits Syst Video Technol 24(12):2077–2089
Yan C, Xie H, Chen J, Zha ZJ, Hao X, Zhang Y, Dai Q (2018) An effective uyghur text detector for complex background images. IEEE Trans Multimedia. https://ieeexplore.ieee.org/document/8361043/
Yan C, Xie H, Liu S, Yin J, Zhang Y, Dai Q (2018) Effective uyghur language text detection in complex background images for traffic prompt identification. IEEE Trans Intell Transp Syst 19(1):220–229
Yan C, Xie H, Yang D, Yin J, Zhang Y, Dai Q (2018) Supervised hash coding with deep neural network for environment perception of intelligent vehicles. IEEE Trans Intell Transp Syst 19(1):284–295
Acknowledgments
This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Science, ICT & Future Planning (No. 2017R1C1B5074984). This research was supported by a Hallym University Research Fund (HRF-201704-014).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kim, JH., Lee, J. An optimized placement of building drawings with moving least squares and K-means clustering. Multimed Tools Appl 78, 11719–11734 (2019). https://doi.org/10.1007/s11042-018-6683-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-018-6683-0