Packing Polyhedra within Convex Sets

Autores

DOI:

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

Palavras-chave:

Packing polyhedra, Computational Geometry, global optimization.

Resumo

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

Publicado

2025-12-24

Como Citar

F. Callisaya, F. C., & 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

Edição

Seção

Artigo Original