Packing Polyhedra within Convex Sets

Simple item page
dc.contributor.authorHector Flores Callisaya
dc.contributor.authorElvis R. V. Kari
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T19:56:50Z
dc.date.available2026-03-22T19:56:50Z
dc.date.issued2025
dc.description.abstractThis 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.
dc.identifier.doi10.5540/tcam.2025.026.e01823
dc.identifier.urihttps://doi.org/10.5540/tcam.2025.026.e01823
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/79073
dc.language.isopt
dc.relation.ispartofTrends in Computational and Applied Mathematics
dc.sourceUniversidade Federal de Mato Grosso
dc.subjectPolyhedron
dc.subjectMathematics
dc.subjectCombinatorics
dc.subjectRegular polygon
dc.subjectContainer (type theory)
dc.subjectPacking problems
dc.subjectSet (abstract data type)
dc.subjectSet packing
dc.subjectConvex polytope
dc.subjectDifferentiable function
dc.titlePacking Polyhedra within Convex Sets
dc.typearticle

Files

Collections

Artículo Científico Publicado