The problem of packing ellipsoids can be defined as follows. Given a set of ellipsoids, each one defined by the lengths of its semi-principal axes, and a container set, the problem consists in finding an arrangement of the ellipsoids (by means of translations and rotations) so that each ellipsoid is inside the container and the ellipsoids do not overlap each other. The container set may be allowed to vary (for example, the container could be a ball whose volume should be minimized) or may be fixed (i.e., it cannot be changed).

Select the paper you would like to know more about and access its dedicated website.