Skip to main content

Advertisement

SpringerLink
Log in

Draft layout generation of building drawings on real urban scenes with boundary particle method and priority solver

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

We propose a method for efficiently and automatically arranging building drawings using a 3D National Geographic Information System (NGIS) within a real-world urban scene. In the architectural design office, in general, the designer manually adjusts the position of each building drawings in order to place buildings within a specific area, so the larger the area to be placed, the higher the processing cost and the longer the working time. On the other hand, we classify the user-specified area based on building regulations, apply the boundary particle method used in fluid simulation, and place building drawings near the boundary according to the area type. Then, we propose a priority map and a priority solver to automatically place buildings as many as possible inside the area, and create several building drawing layouts so that users can select from them. We have reduced the time required for designing urban and apartment complexes by improving the cost of manual labor by automating the optimized layout of building drawings while satisfying the given building regulations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Adamowicz M, Albano A (1976) Nesting two-dimensional shapes in rectangular modules. Comput Aided Des 8(1):27–33

    Article  Google Scholar 

  2. Albano A, Sapuppo G (1980) Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Transactions on Systems, Man, and Cybernetics 10(5):242–248

    Article  Google Scholar 

  3. Alvarez-Valdes R, Martinez A, Tamarit J (2013) A branch & bound algorithm for cutting and packing irregularly shaped pieces. Int J Prod Econ 145 (2):463–477

    Article  Google Scholar 

  4. Amaro B JR, Pinheiro PR, Coelho PV (2017) A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems. Math Probl Eng 2017

  5. Avnaim F, Boissonnat JD (1988) Polygon placement under translation and rotation. In: Annual symposium on theoretical aspects of computer science, pp 322–333

  6. Avnaim F, Bsissonnat J (1987) Simultaneous containment of several polygons. In: Proceedings of the third annual symposium on Computational geometry, pp 242–247

  7. Baker BS, Fortune S, Mahaney SR (1986) Polygon containment under translation. Journal of Algorithms 7(4):532–548

    Article  MathSciNet  MATH  Google Scholar 

  8. Battiato S, Di Blasi G, Farinella GM, Gallo G (2007) Digital mosaic frameworks-an overview. In: Computer graphics forum, vol 26, pp 794–812

  9. Battiato S, Milone A, Puglisi G (2013) Artificial mosaic generation with gradient vector flow and tile cutting. Journal of Electrical and Computer Engineering 2013:8

    Article  MathSciNet  Google Scholar 

  10. Bennell J, Scheithauer G, Stoyan Y, Romanova T (2010) Tools of mathematical modeling of arbitrary object packing problems. Ann Oper Res 179(1):343–368

    Article  MathSciNet  MATH  Google Scholar 

  11. Bennell JA, Oliveira JF (2008) The geometry of nesting problems: a tutorial. Eur J Oper Res 184(2):397–415

    Article  MathSciNet  MATH  Google Scholar 

  12. Bennell JA, Oliveira JF (2009) A tutorial in irregular shape packing problems. J Oper Res Soc 60(1):S93–S105

    Article  MATH  Google Scholar 

  13. Bennell JA, Song X (2008) A comprehensive and robust procedure for obtaining the nofit polygon using minkowski sums. Computers & Operations Research 35(1):267–281

    Article  MathSciNet  MATH  Google Scholar 

  14. Bouganis A, Shanahan M (2007) A vision-based intelligent system for packing 2-d irregular shapes. IEEE Transactions on Automation Science and Engineering 4(3):382–394

    Article  Google Scholar 

  15. Chernov N, Stoyan Y, Romanova T (2010) Mathematical model and efficient algorithms for object packing problem. Comput Geom 43(5):535–553

    Article  MathSciNet  MATH  Google Scholar 

  16. Domovic D, Rolich T, Grundler D, Bogovic S (2014) Algorithms for 2d nesting problem based on the no-fit polygon. In: 2014 37th international convention on information and communication technology, electronics and microelectronics (MIPRO), pp 1094–1099. IEEE

  17. Dowsland KA, Dowsland WB (1995) Solution approaches to irregular nesting problems. European Journal of Operational Research 84(3):506–521

    Article  MATH  Google Scholar 

  18. Egeblad J, Nielsen BK, Odgaard A (2007) Fast neighborhood search for two-and three-dimensional nesting problems. Eur J Oper Res 183(3):1249–1266

    Article  MathSciNet  MATH  Google Scholar 

  19. Fischetti M, Luzzi I (2009) Mixed-integer programming models for nesting problems. J Heuristics 15(3):201–226

    Article  MATH  Google Scholar 

  20. Fowler RJ, Paterson MS, Tanimoto SL (1981) Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12(3):133–137

    Article  MathSciNet  MATH  Google Scholar 

  21. Gomes AM, Oliveira JF (2002) A 2-exchange heuristic for nesting problems. Eur J Oper Res 141(2):359–370

    Article  MathSciNet  MATH  Google Scholar 

  22. Gomes AM, Oliveira JF (2006) Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur J Oper Res 171(3):811–829

    Article  MATH  Google Scholar 

  23. Grinde RB, Cavalier TM (1996) Containment of a single polygon using mathematical programming. European Journal of Operational Research 92(2):368–386

    Article  MATH  Google Scholar 

  24. Grinde RB, Cavalier TM (1997) A new algorithm for the two-polygon containment problem. Computers & Operations Research 24(3):231–251

    Article  MathSciNet  MATH  Google Scholar 

  25. Guo B, Liang Z, Peng Q, Li Y, Wu F (2018) Irregular packing based on principal component analysis methodology. IEEE Access 6:62,675–62,686

    Article  Google Scholar 

  26. Guo W, Cheng X (2011) Study on the application of ant algorithm based upon the lowest contour in rectangular packing. In: 2011 international conference on computer science and service system (CSSS), pp 2622–2625. IEEE

  27. Hausner A (2001) Simulating decorative mosaics. In: Proceedings of the 28th annual conference on computer graphics and interactive techniques, pp 573–580

  28. Jakobs S (1996) On genetic algorithms for the packing of polygons. European Journal of Operational Research 88(1):165–181

    Article  MATH  Google Scholar 

  29. Jiang W, Guo J, Yang J (2016) A two-dimensional nesting algorithm by using no-fit polygon. In: 2016 IEEE 7th annual information technology, electronics and mobile communication conference (IEMCON), pp 1–5. IEEE

  30. Jones DR (2014) A fully general, exact algorithm for nesting irregular shapes. J Glob Optim 59(2-3):367–404

    Article  MathSciNet  MATH  Google Scholar 

  31. Kallrath J (2009) Cutting circles and polygons from area-minimizing rectangles. J Glob Optim 43(2-3):299–328

    Article  MathSciNet  MATH  Google Scholar 

  32. Liu Y, Veksler O, Juan O (2010) Generating classic mosaics with graph cuts. In: Computer graphics forum, vol 29, pp 2387–2399

  33. Marques V, Bispo C, Sentieiro J (1991) A system for the compaction of two-dimensional irregular shapes based on simulated annealing. In: Proceedings IECON’91: 1991 international conference on industrial electronics, control and instrumentation, pp 1911–1916. IEEE

  34. Martin R, Stephenson P (1988) Putting objects into boxes. Comput Aided Des 20(9):506–514

    Article  Google Scholar 

  35. Milenkovic V (1997) Multiple translational containment part ii: exact algorithms. Algorithmica 19(1-2):183–218

    Article  MathSciNet  MATH  Google Scholar 

  36. Milenkovic VJ (1998) Rotational polygon overlap minimization and compaction. Comput Geom 10(4):305–318

    Article  MathSciNet  MATH  Google Scholar 

  37. Milenkovic VJ (1999) Rotational polygon containment and minimum enclosure using only robust 2d constructions. Comput Geom 13(1):3–19

    Article  MathSciNet  MATH  Google Scholar 

  38. Nielsen BK (2007) An efficient solution method for relaxed variants of the nesting problem. In: Proceedings of the thirteenth Australasian symposium on theory of computing, vol 65, p 123–130

  39. Oliveira JFC, Ferreira JAS (1993) Algorithms for nesting problems. In: Applied simulated annealing, pp 255–273. Springer

  40. Peralta J, Andretta M, Oliveira JF (2018) Solving irregular strip packing problems with free rotations using separation lines. Pesquisa Operacional 38(2):195–214

    Article  Google Scholar 

  41. Puglisi G, Battiato S (2013) Artificial mosaic generation. In: Image and video-based artistic stylisation, pp 189–209

  42. Rocha P, Rodrigues R, Gomes AM, Toledo FM, Andretta M (2015) Two-phase approach to the nesting problem with continuous rotations. IFAC-PapersOnLine 48(3):501–506

    Article  Google Scholar 

  43. Segenreich SA, Braga LMPF (1986) Optimal nesting of general plane figures: a monte carlo heuristical approach. Computers & Graphics 10(3):229–237

    Article  Google Scholar 

  44. Stoyan Y, Pankratov A, Romanova T (2016) Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization. J Oper Res Soc 67(5):786–800

    Article  Google Scholar 

  45. Stoyan Y, Scheithauer G, Gil N, Romanova T (2004) Phi-functions for complex 2d-objects. Quarterly Journal of the Belgian, French and Italian Operations Research Societies 2(1):69–84

    MATH  Google Scholar 

  46. Tang D, Zhou Z (2016) No-fit-polygon-based heuristic nesting algorithm for irregular shapes. J Comput Appl 36(9):2540–2544

    Google Scholar 

  47. Toledo FM, Carravilla MA, Ribeiro C, Oliveira JF, Gomes AM (2013) The dotted-board model: a new mip model for nesting irregular shapes. Int J Prod Econ 145(2):478–487

    Article  Google Scholar 

  48. Wong WK, Wang X, Mok P, Leung SYS, Kwong C (2009) Solving the two-dimensional irregular objects allocation problems by using a two-stage packing approach. Expert Syst Appl 36(2):3489–3496

    Article  Google Scholar 

  49. Xu JJ, Wu XS, Liu HM, Zhang M (2017) An optimization algorithm based on no-fit polygon method and hybrid heuristic strategy for irregular nesting problem. In: 2017 36th Chinese control conference (CCC), pp 2858–2863. IEEE

  50. Zheng W, Li B, Yang KR, Li H (2012) Triangle rectangle method for 2d irregular cutting-stock problems. In: Applied mechanics and materials, vol 130, pp 2090–2093. Trans Tech Publ

Download references

Acknowledgements

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 (202002690001).

Author information

Authors and Affiliations

  1. School of Software Application, Kangnam University, Yongin-si, Gyeonggi-do, South Korea

    Jong-Hyun Kim

  2. Hallym University, Chuncheon, Gangwon, South Korea

    Jung Lee

Authors
  1. Jong-Hyun Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jung Lee.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, JH., Lee, J. Draft layout generation of building drawings on real urban scenes with boundary particle method and priority solver. Multimed Tools Appl 80, 29539–29560 (2021). https://doi.org/10.1007/s11042-021-10659-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-021-10659-9

Keywords

Search

Navigation