Struct delaunator::Triangulation[][src]

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

Result of the Delaunay triangulation.

Fields

A vector of point indices where each triple represents a Delaunay triangle. All triangles are directed counter-clockwise.

A vector of adjacent halfedge indices that allows traversing the triangulation graph.

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 EMPTY for outer half-edges on the convex hull).

A vector of indices that reference points on the convex hull of the triangulation, counter-clockwise.

Methods

impl Triangulation
[src]

The number of triangles in the triangulation.

Auto Trait Implementations