This paper reviews the most relevant literature on efficient models and methods for packing
circular objects/items into Euclidean plane regions where the objects/items and regions are …

We further develop our phi-function technique for solving Cutting and Packing problems.
Here we introduce quasi-phi-functions for an analytical description of non-overlapping and …

Despite its important applications in various disciplines in science and engineering, the
Euclidean Voronoi diagram for spheres, also known as an additively weighted Voronoi …

In this paper an optimized multidimensional hyperspheres packing problem (HPP) is
considered for a bounded container. Additional constraints, such as prohibited zones in the …

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 …

In this paper, we propose to solve the circular packing problem (CPP) whose objective is to
pack n different circles Ci of known radius ri, i∈ N={1,…, n}, into the smallest containing …

Abstract The Circle Packing Problem determines a circle of the largest area that can fit into
the vacant space when n arbitrary-sized non-overlapping given circles are placed inside a …

Truss lattices are common in a wide variety of engineering applications, due to their high
ratio of strength versus relative density. They are used both as the interior support for other …

The paper considers the problem of packing a maximal number of identical circles of a given
radius into a multiconnected domain. The domain is a circle with prohibited areas to be finite …

The disk packing problem (DPP) is to find an arrangement of circular disks within the
smallest possible container without any overlap. We discuss a DPP for polysized disks in a …