Struct VoronoiDiagram 

pub struct VoronoiDiagram<C: Coord + Vector<C>> {
    pub sites: Vec<C>,
    pub delaunay: Triangulation,
    pub centers: Vec<C>,
    pub neighbors: Vec<Vec<usize>>,
    /* private fields */
}

Represents a Voronoi 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 circumcenter of each triangle

neighbors: Vec<Vec<usize>>

Stores the neighbor of each cell

Implementations

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

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

Creates a Voronoi diagram, if it exists, for a given set of points.

Points are represented here as anything that implements [delaunator::Coord and delaunator::Vector<Coord>]. delaunator::Coord: ./delaunator/trait.Coord.html

pub fn with_bounding_polygon( points: Vec<C>, clip_polygon: &Polygon<C>, ) -> Option<Self>

Creates a Voronoi diagram, if it exists, for a given set of points bounded by the supplied polygon.

Points are represented here as anything that implements [delaunator::Coord and delaunator::Vector<Coord>]. delaunator::Coord: ./delaunator/trait.Coord.html

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

Creates a Voronoi diagram, if it exists, for a given set of points.

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

pub fn cells(&self) -> &[Polygon<C>]

Returns slice containing the valid cells in the Voronoi diagram.

Cells are represented as a Polygon.

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<C: Hash + Coord + Vector<C>> Hash for VoronoiDiagram<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 VoronoiDiagram<C>

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

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

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

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

Tests for self and other values to be equal, and is used by ==.

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

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 for VoronoiDiagram<C>

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

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

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

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