Struct voronator::delaunator::Triangulation

pub struct Triangulation {
    pub triangles: Vec<usize>,
    pub halfedges: Vec<usize>,
    pub hull: Vec<usize>,
    pub inedges: Vec<usize>,
    pub outedges: Vec<usize>,
}

Represents a Delaunay triangulation for a given set of points. See example in delaunator for usage details.

Fields

triangles: Vec<usize>

Contains the indices for each vertex of a triangle in the original array. All triangles are directed counter-clockwise.

halfedges: Vec<usize>

A Vec<usize> of triangle half-edge indices that allows you to traverse the triangulation. i-th half-edge in the array corresponds to vertex triangles[i] the half-edge is coming from. halfedges[i] is the index of a twin half-edge in an adjacent triangle (or INVALID_INDEX for outer half-edges on the convex hull).

hull: Vec<usize>

A Vec<usize> array of indices that reference points on the convex hull of the input data, counter-clockwise.

inedges: Vec<usize>

A Vec<usize> that contains indices for halfedges of points in the hull that points inwards to the diagram. Only for voronator internal use.

outedges: Vec<usize>

A Vec<usize> that contains indices for halfedges of points in the hull that points outwards to the diagram. Only for voronator internal use.

Implementations

impl Triangulation

pub fn len(&self) -> usize

Returns the number of triangles calculated in the triangulation. Same as triangles.len() / 3.