Struct TreePoisson 

pub struct TreePoisson {
    pub opening_angle: f64,
    pub domain: Domain,
    pub softening: f64,
    /* private fields */
}

Barnes-Hut tree code Poisson solver.

For each grid point the potential is computed via an O(N log N) tree walk with configurable opening angle θ. Smaller θ gives higher accuracy (θ → 0 recovers direct summation) at the cost of more work.

Fields

opening_angle: f64

Opening angle criterion θ for the multipole approximation.

domain: Domain

Computational domain.

softening: f64

Plummer softening length (prevents 1/r singularity).

Implementations

impl TreePoisson

pub fn new(domain: Domain, opening_angle: f64) -> Self

Create a new Barnes-Hut Poisson solver.

opening_angle controls accuracy vs speed (typical values 0.3–1.0). Softening is set to the average cell size.

Trait Implementations

impl PoissonSolver for TreePoisson

fn set_progress(&mut self, p: Arc<StepProgress>)

Register a shared progress handle for intra-step reporting to the TUI.

fn solve(&self, density: &DensityField, g: f64) -> PotentialField

Solve for the gravitational potential Φ by building an octree and performing an O(N log N) tree walk at each grid point.

fn compute_acceleration(&self, potential: &PotentialField) -> AccelerationField

Compute gravitational acceleration g = -∇Φ via second-order centered finite differences.