Related papers: In a search for a shape maximizing packing fractio…
Rotating synthetic aperture (RSA) imaging system captures images of the target scene at different rotation angles by rotating a rectangular aperture. Deblurring acquired RSA images plays a critical role in reconstructing a latent sharp…
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 propose a new approach to obtain the nanoscale morphology of rough surfaces from low-temperature adsorption experiments. Our method is based on one of the most realistic models of rough surfaces formulated in terms of random correlated…
We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and…
Given a point set $S=\{s_1,\ldots , s_n\}$ in the unit square $U=[0,1]^2$, an anchored square packing is a set of $n$ interior-disjoint empty squares in $U$ such that $s_i$ is a corner of the $i$th square. The reach $R(S)$ of $S$ is the set…
We present an analytical derivation of the volume fractions for random close packing (RCP) in both $d=3$ and $d=2$, based on the same methodology. Using suitably modified nearest neigbhour statistics for hard spheres, we obtain…
We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the $n$ vertices at random, and sequentially declare each vertex either active or frozen, depending on some local rule in terms of…
The fluctuations of the jamming coverage upon Random Sequential Adsorption (RSA) are studied using both analytical and numerical techniques. Our main result shows that these fluctuations (characterized by $\sigma_{\theta_J}$) decay with the…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
We present an autodifferentiable rejection sampling algorithm termed Rejection Sampling with Autodifferentiation (RSA). In conjunction with reweighting, we show that RSA can be used for efficient parameter estimation and model exploration.…
We revisit the densest binary sphere packings (DBSP) under the periodic boundary conditions and present an updated phase diagram, including newly found 12 putative densest structures over the $x - \alpha$ plane, where $x$ is the relative…
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…
We study the percolation and jamming of rods ($k$-mers) on a square lattice that contains defects. The point defects are placed randomly and uniformly on the substrate before deposition of the rods. The general case of unequal probabilities…
We examine the reversible adsorption of hard spheres on a random site surface in which the adsorption sites are uniformly and randomly distributed on a plane. Each site can be occupied by one solute provided that the nearest occupied site…
Inspired by observations of beads packed on a thin string in such systems as sea-grapes and dental plaque, we study the random sequential adsorption of spheres on a cylinder. We determine the asymptotic fractional coverage of the cylinder…
We address the following problem: given two smooth densities on a manifold, find an optimal diffeomorphism that transforms one density into the other. Our framework builds on connections between the Fisher-Rao information metric on the…
We report on experiments to measure the temporal and spatial evolution of packing arrangements of anisotropic and weakly confined granular material, using high-resolution $\gamma$-ray adsorption. In these experiments, the particle…
Although the concept of random close packing with an almost universal packing fraction of ~ 0.64 for hard spheres was introduced more than half a century ago, there are still ongoing debates. The main difficulty in searching the densest…
We discuss two important techniques, series expansion and Monte Carlo simulation, for random sequential adsorption study. Random sequential adsorption is an idealization for surface deposition where the time scale of particle relaxation is…
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an…