The paper studies a layout problem of variable number of ellipses with variable sizes placed
into an arbitrary disconnected polygonal domain with maximum packing factor. The ellipses …

Dense particle packing in a confining volume remains a rich, largely unexplored problem,
despite applications in blood clotting, plasmonics, industrial packaging and transport …

The paper studies packing ellipsoids of revolution in a cylindrical container of minimum
volume. Ellipsoids can be continuously rotated and translated. Two nonlinear mathematical …

Abstract 3D printing, also called additive manufacturing, has been increasingly popular and
printing efficiency has become more critical. To print artifacts faster with less material, thus …

A placement problem of irregular 2D&3D objects in a domain (container) of minimum area
(volume), that related to the field of Packing and Cutting problems is considered. Placement …

The paper studies packing ellipses in a rectangular container of minimum area. The problem
has various applications in production, logistics, industrial design. New phi-functions are …

A method for packing irregular particles with a prescribed volume fraction is proposed.
Furthermore, the generated granular material adheres to the prescribed statistical …

The concept of the sparsest packing is introduced in this paper. The sparsest packing is
aimed to place the objects in the container as distant as possible. More specifically, the …

The authors consider the problem of generating spheroidal voids in a three-dimensional
domain of complex geometry, with regard for the constraints on the “sparseness” of voids …

Packing ellipses with arbitrary orientation into a convex polygonal container which has a
given shape is considered. The objective is to find a minimum scaling (homothetic) …