Struct RandomPacking 

pub struct RandomPacking {
    pub config: RsaConfig,
    pub spheres: Vec<PackingSphere>,
    pub n_rejected: usize,
    pub jammed: bool,
}

Random packing via Random Sequential Adsorption (RSA).

In RSA, spheres are placed one at a time at random positions, accepted only if they do not overlap with already-placed spheres. The process terminates at the jamming limit (~64% for equal spheres in 3D).

Fields

config: RsaConfig

RSA configuration.

spheres: Vec<PackingSphere>

Placed spheres.

n_rejected: usize

Number of rejected attempts.

jammed: bool

Whether the packing has reached the jamming limit.

Implementations

impl RandomPacking

pub fn new(config: RsaConfig) -> Self

Create a new RSA packing system.

pub fn try_place_sphere(&mut self, rng: &mut impl Rng) -> bool

Attempt to place one sphere at a random location.

Returns true if placement succeeded.

pub fn is_valid_placement(&self, candidate: &PackingSphere) -> bool

Check if a sphere can be placed without overlap.

pub fn run(&mut self) -> usize

Run the RSA algorithm until jammed.

Returns the number of spheres placed.

pub fn packing_fraction(&self) -> f64

Compute the current packing fraction (volume fraction).

pub fn theoretical_jamming_limit() -> f64

Compute the theoretical jamming limit for monodisperse RSA in 3D.

The RSA jamming limit in 3D is approximately 0.3841.

pub fn count_contacts(&self, tolerance: f64) -> usize

Return the number of contacts (overlapping pairs) in the packing.

pub fn place_at(&mut self, center: [f64; 3]) -> bool

Place spheres at specific locations (for testing).