Struct voronator::CentroidDiagram

pub struct CentroidDiagram<C: Coord + Vector<C>> {
    pub sites: Vec<C>,
    pub delaunay: Triangulation,
    pub centers: Vec<C>,
    pub cells: Vec<Polygon<C>>,
    pub neighbors: Vec<Vec<usize>>,
}

Represents a centroidal tesselation diagram.

Fields

sites: Vec<C>

Contains the input data

delaunay: Triangulation

A Triangulation struct that contains the Delaunay triangulation information.

centers: Vec<C>

Stores the centroid of each triangle

cells: Vec<Polygon<C>>

Stores the coordinates of each vertex of a cell, in counter-clockwise order

neighbors: Vec<Vec<usize>>

Stores the neighbor of each cell

Implementations

impl<C: Coord + Vector<C>> CentroidDiagram<C>

pub fn new(points: &[C]) -> Option<Self>

Creates a centroidal tesselation, if it exists, for a given set of points.

Points are represented here as a delaunator::Point.

pub fn from_tuple(coords: &[(f64, f64)]) -> Option<Self>

Creates a centroidal tesselation, if it exists, for a given set of points.

Points are represented here as a (f64, f64) tuple.

Trait Implementations

impl<C: Clone + Coord + Vector<C>> Clone for CentroidDiagram<C>

fn clone(&self) -> CentroidDiagram<C>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<C: Debug + Coord + Vector<C>> Debug for CentroidDiagram<C>

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

Formats the value using the given formatter.

impl<C: Hash + Coord + Vector<C>> Hash for CentroidDiagram<C>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<C: Ord + Coord + Vector<C>> Ord for CentroidDiagram<C>

fn cmp(&self, other: &CentroidDiagram<C>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<C: PartialEq + Coord + Vector<C>> PartialEq<CentroidDiagram<C>> for CentroidDiagram<C>

fn eq(&self, other: &CentroidDiagram<C>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<C: PartialOrd + Coord + Vector<C>> PartialOrd<CentroidDiagram<C>> for CentroidDiagram<C>

fn partial_cmp(&self, other: &CentroidDiagram<C>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<C: Eq + Coord + Vector<C>> Eq for CentroidDiagram<C>

impl<C: Coord + Vector<C>> StructuralEq for CentroidDiagram<C>

impl<C: Coord + Vector<C>> StructuralPartialEq for CentroidDiagram<C>