Struct PlanarCoverageModel 

pub struct PlanarCoverageModel { /* private fields */ }

Declared geometric contract for the planar controlled-boundary theorem.

The constructor checks the exact radius inequality from assumption A2. The caller declares A3: nodes lie in one compact connected planar domain. The caller declares geometric A4: the fence cycle maps to that domain’s connected piecewise-linear boundary. The checker validates the graph, unique labels, fence edges, radii, and relative chain. It cannot recover the domain from connectivity data.

Implementations

impl PlanarCoverageModel

pub fn new(broadcast_radius: f64, sensing_radius: f64) -> Result<Self>

Construct the controlled-boundary radius contract.

Both radii must be finite and positive. The exact dyadic values must satisfy 3 * sensing_radius^2 >= broadcast_radius^2.

pub fn broadcast_radius(self) -> f64

Radius used to construct the communication graph.

pub fn sensing_radius(self) -> f64

Radius of each declared sensing disc.

Trait Implementations

impl Clone for PlanarCoverageModel

fn clone(&self) -> PlanarCoverageModel

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PlanarCoverageModel

impl Debug for PlanarCoverageModel

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

Formats the value using the given formatter.

impl PartialEq for PlanarCoverageModel

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PlanarCoverageModel