Skip to main content
SpringerLink
Log in

Optimized Packing Soft Convex Polygons

  • Conference paper
  • First Online:
Computer Science and Engineering in Health Services (COMPSE 2022)

Part of the book series: EAI/Springer Innovations in Communication and Computing ((EAISICC))

Included in the following conference series:

Abstract

Packing soft convex polygons in an optimized convex container is considered. It is assumed that the soft polygonal object can change its shape in certain limits, while its area remains constant. Non-overlapping, containment, and area conservation constraints are formulated for soft polygonal objects, and a corresponding nonlinear programming model is presented. Numerical experiments for packing soft triangles and pentagons in optimized circular and quadratic containers are presented to demonstrate efficiency of the proposed approach.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fügenschuh, A., Junosza-Szaniawski, K., Lonc, Z.: Exact and approximation algorithms for a soft rectangle packing problem. Optimization. 63(11), 1637–1663 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ji, P., He, K., Jin, Y., Lan, H., Li, C.: An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. Comput. Oper. Res. 86, 110–123 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brenner, U.: γ -Soft packings of rectangles. Comput. Geom. 70, 49–64 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bui, Q.T., Vida, T., Hà, M.H.: On three soft rectangle packing problems with guillotine constraints. J. Glob. Optim. 74, 45–62 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  5. Winkelmann, J.: Structures of Columnar Packings with Soft and Hard Spheres, PhD Thesis, School of Physics, Trinity College, Dublin (2020)

    Google Scholar 

  6. Romanova, T., Stoyan, Y., Pankratov, A., Litvinchev, I., Kravchenko, O., Duryagina, Z., Chugai, A.: Optimized packing soft ellipses. In: Manshahia, M.S., Litvinchev, I., Thomas, J.J., Vasant, P., Weber, W.G. (eds.) Human Assisted Intelligent Computing: Modelling, Simulations and Applications. IOP, United Kingdom (2023)

    Google Scholar 

  7. Jiang, J., Garikipati, K., Rudraraju, S.: A diffuse interface framework for modeling the evolution of multi-cell aggregates as a soft packing problem driven by the growth and division of cells. Bull. Math. Biol. 81, 3282–3300 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  8. Yuan, Q., Li, Z., Gao, Y., Wang, Y.H., Li, X.: Local responses in 2D assemblies of elliptical rods when subjected to biaxial shearing. Acta Geotech. 14, 1685–1697 (2019)

    Article  Google Scholar 

  9. Chen, Y., Yuan, M., Wang, Z., Zhao, Y., Li, J., Hu, B., Xia, C.: Structural characterization and statistical properties of jammed soft ellipsoid packing. Soft Matter. 17, 2963 (2021). https://doi.org/10.1039/d0sm01699c

    Article  Google Scholar 

  10. Lewis, B.A., Robinson, J.S.: Triangulation of planar regions with applications. Comput. J. 21(4), 324–332 (1978). https://doi.org/10.1093/comjnl/21.4.324

    Article  MATH  Google Scholar 

  11. Litvinchev, I., Romanova, T., Corrales-Diaz, R., Esquerra-Arguelles, A., Martinez-Noa, A.: Lagrangian approach to modeling placement conditions in optimized packing problems. Mob. Netw. Appl. 25, 2126–2133 (2020)

    Article  Google Scholar 

  12. Sahinidis, N.V.: BARON 19.12.7: Global Optimization of Mixed-Integer Nonlinear Programs, User’s Manual (2019)

    Google Scholar 

  13. Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225–249 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Allgower, E.L., Schmidt, P.H.: Computing volumes of polyhedra. Math. Comput. 46(173), 171–174 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  15. Braden, B.: The surveyor’s area formula. Coll. Math. J. 17(4), 326–337 (1986)

    Article  Google Scholar 

  16. Litvinchev, I., Infante, L., Ozuna Espinosa, E.L.: Approximate circle packing in a rectangular container: integer programming formulations and valid inequalities. In: González-Ramírez, R.G., Schulte, F., Voß, S., Ceroni Díaz, J.A. (eds.) Computational Logistics. ICCL 2014. Lecture Notes in Computer Science, vol. 8760. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11421-7_4

    Chapter  Google Scholar 

  17. Romanova, T., Litvinchev, I., Pankratov, A.: Packing ellipsoids in an optimized cylinder. Eur. J. Oper. Res. 285(2), 429–443 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  18. Romanova, T., Stoyan, Y., Pankratov, A., Litvinchev, I., Plankovskyy, S., Tsegelnyk, Y., Shypul, O.: Sparsest balanced packing of irregular 3D objects in a cylindrical container. Eur. J. Oper. Res. 291(1), 84–100 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kallrath, J., Romanova, T., Pankratov, A., Litvinchev, I., Infante, L.: Packing convex polygons in minimum-perimeter convex hulls. J. Glob. Optim. 85(1), 39–59 (2023). https://doi.org/10.1007/s10898-022-01194-4

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate Program in Systems Engineering, Nuevo Leon State University (UANL), Monterrey, San Nicolas de los Garza, Nuevo Leon, Mexico

    Igor Litvinchev, Luis Infante, Alberto Martinez-Noa & Luis Gutierrez

  2. Department of Mathematical Modeling and Optimal Design, Institute for Mechanical Engineering Problems of the National Academy of Sciences of Ukraine, Kharkiv, Ukraine

    Tatiana Romanova

Authors
  1. Igor Litvinchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis Infante
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tatiana Romanova
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alberto Martinez-Noa
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Luis Gutierrez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineering Department, National Autonomous University of Mexico, Mexico City, Distrito Federal, Mexico

    José Antonio Marmolejo-Saucedo

  2. Facultad de Ciencias Economicas Y Empresariales, Universidad Panamericana, Ciudad de Mexico, Mexico

    Roman Rodríguez-Aguilar

  3. Universiti Teknologi Petronas, Tronoh, Perak, Malaysia

    Pandian Vasant

  4. Graduate Program in Systems Engineering, Nuevo Leon State University, San Nicolás de los Garza, Mexico

    Igor Litvinchev

  5. School of Engineering, Universidad Anahuac México, Naucalpan de Juárez, Mexico

    Brenda M. Retana-Blanco

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Litvinchev, I., Infante, L., Romanova, T., Martinez-Noa, A., Gutierrez, L. (2024). Optimized Packing Soft Convex Polygons. In: Marmolejo-Saucedo, J.A., Rodríguez-Aguilar, R., Vasant, P., Litvinchev, I., Retana-Blanco, B.M. (eds) Computer Science and Engineering in Health Services. COMPSE 2022. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-031-34750-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34750-4_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34749-8

  • Online ISBN: 978-3-031-34750-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation