相关论文: A geometric probabilistic approach to random packi…
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 study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an approach for reducing a Gibbs point process to the hard-core…
Identifying ordered structures hidden in the packings of particles is a common scientific question in multiple fields. In this work, we investigate the dynamical organizations of a large number of initially randomly packed repulsive…
Probabilistic graphical models allow us to encode a large probability distribution as a composition of smaller ones. It is oftentimes the case that we are interested in incorporating in the model the idea that some of these smaller…
We use a new version of the reversible Parking Lot Model to study the compaction of vibrated polydisperse media. The particle sizes are distributed according to a truncated power law. We introduce a self-consistent desorption mechanism with…
We study photon diffusion in a two-dimensional random packing of monodisperse disks as a simple model of granular material. We apply ray optics approximation to set up a persistent random walk for the photons. We employ Fresnel's intensity…
Packing problems, even of objects with regular geometries, are in general non-trivial. For few special shapes, the features of crystalline as well as random, irregular two-dimensional (2D) packings are known. The packing of 2D crosses does…
We report calculations of the density of maximally random jamming (aka random close packing) of one-component and binary hard disc fluids. The theoretical structure used provides a common framework for description of the hard disc liquid to…
Randomly packing spheres of equal size into a container consistently results in a static configuration with a density of ~64%. The ubiquity of random close packing (RCP) rather than the optimal crystalline array at 74% begs the question of…
We have discovered that two significant quantities within hard particle systems: the probability of successfully inserting an additional particle at random and the scale distribution function, can be connected by a concise relation. We…
This is the first paper of a series of three, reporting on numerical simulation studies of geometric and mechanical properties of static assemblies of spherical beads under an isotropic pressure. Frictionless systems assemble in the unique…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
We developed a novel experimental technique to generate mechanically stable (MS) packings of frictionless granular disks. We performed a series of coordinated experiments and numerical simulations to enumerate the MS packings in small 2D…
Using sedimentation to obtain precisely controlled packings of noncohesive spheres, we find that the volume fraction $\phi_{\rm RLP}$ of the loosest mechanically stable packing is in an operational sense well defined by a limit process.…
Whether it is object detection, model reconstruction, laser odometry, or point cloud registration: Plane extraction is a vital component of many robotic systems. In this paper, we propose a strictly probabilistic method to detect finite…
The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…
We consider packings of the plane using discs of radius 1 and r=0.545151... . The value of r admits compact packings in which each hole in the packing is formed by three discs which are tangent to each other. We prove that the largest…
The study of "random segments" is a classic issue in geometrical probability, whose complexity depends on how it is defined. But in apparently simple models, the random behavior is not immediate. In the present manuscript the following…
We have studied the contact network properties of two and three dimensional polydisperse, frictionless sphere packings at the random closed packing density through simulations. We observe universal correlations between particle size and…
An approximate formulation of a robust geometric program (RGP) as a convex program is proposed. Interest in using geometric programs (GPs) to model complex engineering systems has been growing, and this has motivated explicitly modeling the…