Ellipsoid packing¶

The geometric optimization problem of arranging congruent ellipsoids in three-dimensional space without overlap so their asymptotic occupied-volume fraction is maximized.

Version: v1 · 2026-09-28 · History
Domain-specific #: 9212
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Discrete Geometry, Packing Problems → Mathematics

Core Idea¶

Ellipsoid packing asks how congruent ellipsoids can be positioned and oriented throughout three-dimensional space without overlap so that the occupied-volume fraction is as large as possible. Shape is specified by semiaxes or aspect ratios, while translations, rotations, and unit-cell parameters define a candidate arrangement.

Unlike spheres, ellipsoids can use orientational order and multiple orientations within one cell to close voids. Dense known structures include a simple monoclinic crystal with two orientations and a more complex square–triangle crystal with twenty-four particles per fundamental cell.

The best structure depends on uniaxial or biaxial shape. Reported fractions near 0.77073 exceed the densest sphere packing for suitable aspect ratios, but densest known is not automatically a proof of global optimality. Feasibility, density calculation, and evidence of optimality must be stated separately.

Structural Signature¶

Sig role-phrases:

Congruent ellipsoid shape. Fixes three semiaxes or aspect ratios shared by every particle. Constitutive object. If altered: Allowing different shapes changes the problem to a mixture or adaptive packing.
Positions and orientations. Place each anisotropic body in space while selecting rotational alignment. Identity-bearing configuration variables. If altered: Ignoring orientation reduces the attainable structures and can miss dense phases.
Nonoverlap constraints. Require interiors of distinct ellipsoids to remain disjoint, including periodic images. Constitutive feasibility condition. If altered: A high nominal density with intersections is not a packing.
Packing fraction and cell. Compares total ellipsoid volume with fundamental-cell volume or asymptotic region volume. Identity-bearing objective. If altered: A finite cluster’s local density is not automatically a space-filling fraction.

What It Is Not¶

Not sphere packing. Equal axes remove orientation as a packing variable.
Not container filling. Boundary effects differ from infinite-space asymptotic density.
Not mixed-particle packing. The standard problem fixes congruent ellipsoids.
Not proven optimum by simulation. A high-density candidate needs an independent global bound for optimality.

Scope of Application¶

The problem applies to geometric optimization and models of anisotropic particle organization under nonoverlap.

Discrete geometry. Constructions and bounds compare packing fractions.
Crystallography. Unit cells and orientations define ordered candidate phases.
Granular matter. Ellipsoidal particles model shape-dependent compaction.
Colloids. Anisotropic bodies exhibit orientational and positional phases.
Numerical optimization. Cell and particle degrees of freedom search candidate structures.

Clarity¶

State semiaxes, congruence, infinite or periodic setting, cell vectors, basis positions, orientations, density formula, and overlap test. Distinguish uniaxial from biaxial ellipsoids and candidate record from theorem. Report numerical precision and stability under perturbation.

Manages Complexity¶

The abstraction separates particle shape, configuration, feasibility, and objective. Periodic cells compress an infinite arrangement into finite data, while orientation exposes why anisotropic bodies can outperform spheres and why the phase diagram depends on aspect ratio.

Abstract Reasoning¶

Normalize ellipsoid axes and select the shape family.
Parameterize a cell, basis positions, and particle orientations.
Enforce nonoverlap for all particles and neighboring periodic images.
Optimize ellipsoid volume divided by cell volume and test structural perturbations.
Compare candidates and proven bounds without converting numerical evidence into an optimality proof.

Knowledge Transfer¶

Packing optimization transfers to other convex bodies, but ellipsoid-specific contacts and orientational degrees do not. Affine images of sphere packings provide candidates, not the entire solution space.

Examples¶

Canonical¶

A periodic monoclinic cell contains two congruent ellipsoids in different orientations, satisfies all image-contact constraints, and yields a fraction near the reported dense candidate.

Mapped back: congruent ellipsoid shape → fixed aspect ratio; positions and orientations → two-particle oriented basis; nonoverlap constraints → periodic contact checks; packing fraction and cell → ellipsoid volume over monoclinic cell volume.

Applied / In Practice¶

For a biaxial family, an optimizer compares the two-particle cell with a 24-particle square–triangle basis across aspect ratios and reports where their density curves cross.

Mapped back: congruent ellipsoid shape → parameterized biaxial axes; positions and orientations → competing crystal bases; nonoverlap constraints → validated for each shape; packing fraction and cell → phase-dependent objective.

Structural Tensions¶

T1: small unit cell vs. structural richness. Simple cells are searchable but can miss denser multi-orientation phases. Diagnostic: Which cell sizes and symmetries were excluded?

T2: record density vs. global proof. Numerical constructions give lower bounds while optimality requires upper bounds. Diagnostic: What certifies that no denser packing exists?

T3: shape anisotropy vs. orientational order. Greater anisotropy opens void-filling possibilities but complicates contacts and phases. Diagnostic: Which orientations produce the gain?

Structural–Framed Character¶

Ellipsoid packing is strongly structural. Evaluative weight: density and proof status are judged. Human-practice-bound: parameterizations and numerical searches are chosen. Institutional origin: discrete geometry and materials physics stabilize it. Vocabulary travels: packing and optimization travel. Import versus recognize: literal use requires congruent ellipsoids and nonoverlap. Its character: a shape-dependent global density optimization with rotational freedom.

Structural Core vs. Domain Accent¶

Skeletal core. Congruent objects are arranged under exclusion constraints to maximize occupied fraction.

Domain-bound accent. Objects are three-dimensional ellipsoids whose orientations and aspect ratios alter dense structures.

Why not prime. Packing is portable, but ellipsoid packing is a specialist geometric problem.

This entry is a kind of Packing Problem.

Packing. Nonoverlapping bodies occupy space.
Optimization. Configuration variables maximize global density.
Symmetry. Unit cells and orientations organize candidate structures.
The approved root remains.

Relationships to Other Abstractions¶

Current abstraction Ellipsoid packing Domain-specific

Parents (1) — more general patterns this builds on

Ellipsoid packing is a kind of Packing Problem Domain-specific

It maximizes nonoverlapping ellipsoid density in a declared region or space.

Hierarchy path (1) — routes to 1 parentless root

Ellipsoid packing → Packing Problem → Optimization

Neighborhood in Abstraction Space¶

Ellipsoid packing sits in a sparse region of the domain-specific corpus (74^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Domain-Specific Measurement Parameters (36 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Sphere packing. Tell: It is the equal-axis special case with no orientational degree.
Random close packing. Tell: That protocol-dependent disordered state is not the global geometric optimum.
Container packing. Tell: Finite boundaries change the objective and feasible arrangements.
Ellipsoid covering. Tell: Covering permits overlap and minimizes density needed to cover space.

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Ellipsoid_packing (revision 1362875170).

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.