Struct ReebGraph 

pub struct ReebGraph {
    pub nodes: Vec<ReebNode>,
    pub arcs: Vec<ReebArc>,
}

Reeb graph of a scalar function on a mesh.

The Reeb graph tracks the evolution of connected components of level sets f^{-1}(c) as c varies.

Fields

nodes: Vec<ReebNode>

Nodes of the Reeb graph (critical points)

arcs: Vec<ReebArc>

Arcs connecting nodes

Implementations

impl ReebGraph

pub fn new() -> Self

Creates an empty Reeb graph.

pub fn compute(values: &[f64], edges: &[[usize; 2]]) -> Self

Computes the Reeb graph of a scalar function on a set of vertices.

Arguments

• values - Scalar function values at each vertex
• edges - Edge connectivity of the mesh

pub fn n_critical_points(&self) -> usize

Returns the number of critical points.

pub fn n_minima(&self) -> usize

Returns the number of minima.

pub fn n_maxima(&self) -> usize

Returns the number of maxima.

pub fn n_saddles(&self) -> usize

Returns the number of saddles.

Trait Implementations

impl Clone for ReebGraph

fn clone(&self) -> ReebGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReebGraph

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

Formats the value using the given formatter.

impl Default for ReebGraph

fn default() -> Self

Returns the “default value” for a type.