Search Results for ""

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

An interval into which a given data point does or does not fall.

The placement of objects so that they touch in some specified manner, often inside a container with specified properties. For example, one could consider a sphere packing, ...

A problem is an exercise whose solution is desired. Mathematical "problems" may therefore range from simple puzzles to examination and contest problems to propositions whose ...

A packing of polyhedron in three-dimensional space. A polyhedron which can pack with no holes or gaps is said to be a space-filling polyhedron. Betke and Henk (2000) present ...

Define the packing density eta of a packing of spheres to be the fraction of a volume filled by the spheres. In three dimensions, there are three periodic packings for ...

The best known packings of equilateral triangles into an equilateral triangle are illustrated above for the first few cases (Friedman). The best known packings of equilateral ...

The fraction eta of a volume filled by a given collection of solids.

Maximize the amount of floor space which can be covered with a fixed tile (Hoffman 1998, p. 173).

A circle packing is an arrangement of circles inside a given boundary such that no two overlap and some (or all) of them are mutually tangent. The generalization to spheres ...