Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Packing Polyhedra within Convex Sets

View through CrossRef
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.
Brazilian Society for Computational and Applied Mathematics (SBMAC)
Title: Packing Polyhedra within Convex Sets
Description:
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.

Related Results

Ostrowski-Type Fractional Integral Inequalities: A Survey
Ostrowski-Type Fractional Integral Inequalities: A Survey
This paper presents an extensive review of some recent results on fractional Ostrowski-type inequalities associated with a variety of convexities and different kinds of fractional ...
New Gravel Pack Tool for Improving Pack Placement
New Gravel Pack Tool for Improving Pack Placement
A new type of gravel packing tool may eliminate the need for the pressure washing and repacking that are frequently required. This tool performs equally well in vertical wells and ...
Production Tubing Frac Pack: An Unconventional Multi-Zone Design with Significant Cost Savings
Production Tubing Frac Pack: An Unconventional Multi-Zone Design with Significant Cost Savings
Abstract The conventional process of frac packing that was initiated in the early 1990s and revolutionized the industry is well documented in the literature (Meese, ...
Convex hull peeling
Convex hull peeling
Enveloppes convexes pelées Cette thèse porte sur la construction du convex hull peeling (qu’on pourrait traduire littéralement par enveloppe convexe pelée). Le conv...
Decomposable Convexities in Graphs and Hypergraphs
Decomposable Convexities in Graphs and Hypergraphs
Given a connected hypergraph with vertex set V, a convexity space on is a subset of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under inter...
Spectral Polyhedra
Spectral Polyhedra
AbstractA spectral convex set is a collection of symmetric matrices whose range of eigenvalues forms a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitope...

Back to Top