Packing Polyhedra within Convex Sets

Authors

DOI:

https://doi.org/10.5540/tcam.2025.026.e01823

Keywords:

Packing polyhedra, Computational Geometry, global optimization.

Abstract

This work addresses two problems related to packing identical regular polyhedra, focusing on triangles and squares. The first problem seeks to maximize the number of identical regular polyhedra that can be packed within a convex set or container.The second problem focuses on achieving the densest possible packing of a fixed number of identical regular polyhedra within a container of a given type. Both problems are modeled as nonlinear differentiable programming problems.

Downloads

Published

2025-12-24

How to Cite

F. Callisaya, H., & R. V. Kari, E. (2025). Packing Polyhedra within Convex Sets. Trends in Computational and Applied Mathematics, 26(1), e01823. https://doi.org/10.5540/tcam.2025.026.e01823

Issue

Vol. 26 No. 1 (2025)

Section

Original Article

License

Copyright (c) 2025 Trends in Computational and Applied Mathematics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Copyright

Authors of articles published in the journal Trends in Computational and Applied Mathematics retain the copyright of their work. The journal uses Creative Commons Attribution (CC-BY) in published articles. The authors grant the TCAM journal the right to first publish the article.

Intellectual Property and Terms of Use

The content of the articles is the exclusive responsibility of the authors. The journal uses Creative Commons Attribution (CC-BY) in published articles. This license allows published articles to be reused without permission for any purpose as long as the original work is correctly cited.

The journal encourages Authors to self-archive their accepted manuscripts, publishing them on personal blogs, institutional repositories, and social media, as long as the full citation is included in the journal's website version.