Related papers: On regular and random two-dimensional packing of c…
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…
Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…
A Comment by Morse and Charbonneau shows that our recent analytical solution to the random close packing (RCP) problem is in good agreement with packings data in dimensions $d<6$ but deviates from the data for $d\geq6$. In this Reply we…
Connectedness percolation phenomena in the two-dimensional (2D) packing of binary mixtures of disks with different diameters were studied numerically. The packings were produced using random sequential adsorption (RSA) model with…
We study the structural properties of two-dimensional granular packings prepared by random deposition from a source line. We consider a class of random ballistic deposition models based on single-particle relaxation rules controlled by a…
This paper deals with the problem of circle packing, in which the largest radii circle is to be fit in a confined space filled with arbitrary circles of different radii and centers. A circle packing problem is one of a variety of cutting…
Random packings of objects of a particular shape are ubiquitous in science and engineering. However, such jammed matter states have eluded any systematic theoretical treatment due to the strong positional and orientational correlations…
We study two-dimensional random sequential adsorption (RSA) of flat polygons and rounded squares aligned in parallel to find a transition in the asymptotic behavior of the kinetics of packing growth. Differences in the kinetics for RSA of…
In this paper the random packing fraction of hard disks in a plane is analyzed, following a geometric probabilistic approach. First, the random close packing (RCP) of equally sized disks is modelled. Subsequently, following the same…
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…
Packing is a complex phenomenon of prominence in many natural and industrial processes (liquid crystals, granular materials, infiltration, melting, flow, sintering, segregation, sedimentation, compaction, etc.). A variety of computational…
We consider the complexity of Delaunay triangulations of sets of points in R^3 under certain practical geometric constraints. The spread of a set of points is the ratio between the longest and shortest pairwise distances. We show that in…
Connectedness percolation phenomena in two-dimensional packings of elongated particles (discorectangles) were studied numerically. The packings were produced using random sequential adsorption (RSA) off-lattice model with preferential…
We suggest two metrics for assessing the quality of atomistic configurations of disordered materials, both of which are based on quantifying the orientational distribution of neighbours around each atom in the configuration. The first…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
We define and consider k-distant crossings and nestings for matchings and set partitions, which are a variation of crossings and nestings in which the distance between vertices is important. By modifying an involution of Kasraoui and Zeng…
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…
The three dimensional structure of large packings of monosized spheres with volume fractions ranging between 0.58 and 0.64 has been studied with X-ray Computed Tomography. We search for signatures of organization, we classify local…
We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…
Cutting and packing problems are present in many, at first glance unconnected, areas, therefore it's beneficial to have a good understanding of their underlying structure, to select proper techniques for finding solutions. Cutting and…