Struct Interface 

struct Interface {
    n: u32,
    p: f64,
}

Running statistics for one interface between two regions.

p is directed: for the entry stored under adjacency[a][b] it is the sum taken as a minus b, so adjacency[b][a] holds its negation.

Fields

n: u32

N_AB: the number of interfacing voxel pairs.

p: f64

P_AB = Σ (ψ_Aj − ψ_Bk) over those pairs, where ψ is the phase in the current working frame — the wrapped phase plus whatever turns previous merges have already committed to.

Implementations

impl Interface

fn k(self) -> f64

K_AB = −P_AB / (2π·N_AB), the continuous minimum of eq 6.

fn offset(self) -> f64

L_AB = round(K_AB): the integer offset the merge would commit to (eq 7).

fn cost(self) -> f64

ΔC_AB = 8π²·N_AB·(½ − |K_AB − L_AB|), the smallest cost penalty for getting this interface’s offset wrong by one turn (eq 9).

Non-negative, since rounding bounds |K − L| by ½. It is largest for a wide interface whose mean phase step lands near a whole number of turns, and falls to zero when the step is exactly half a turn and the rounding is a coin toss.

Trait Implementations

impl Clone for Interface

fn clone(&self) -> Interface

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Interface

impl Debug for Interface

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for Interface

fn eq(&self, other: &Interface) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Interface