Struct triangular::Triangulation

pub struct Triangulation<'a, T, V> where
    T: BaseFloat,
    V: Into<Vector2<T>>,  { /* fields omitted */ }

Implementations

impl<'a, T, V> Triangulation<'a, T, V> where
    T: BaseFloat,
    V: Into<Vector2<T>> + Copy, 

pub fn new(points: &'a [V]) -> Self

Returns a new Triangulations object that holds the configuration and a reference to the points

use triangular::Triangulation;

let points = vec![(0.6, 1.1),
                  (0.2, 1.5),
                  (0.8, 1.6)];

let triangles = Triangulation::new(&points);

pub fn with_bounds(self, c1: V, c2: V) -> Self

Return all Triangles calculated within the specified bounds

use triangular::Triangulation;

// build a set of points
let points = vec![(0.6, 1.1),
                  (0.2, 1.5),
                  (0.8, 1.6)];

let triangles = Triangulation::new(&points)
                    .with_bounds((0.0, 0.0), (2.0, 2.0))
                    .build();
assert_eq!(&*triangles, &[2, 1, 0]);

pub fn with_max_len(self, max_len: T) -> Self

Return all Triangles Calculated with edges < max_len

use triangular::Triangulation;

// build a set of points
let points = vec![(0.6, 1.1),
                  (0.2, 1.5),
                  (0.8, 1.6)];

let triangles = Triangulation::new(&points)
                    .with_max_len(0.1)
                    .build();
assert_eq!(&*triangles, &[]);

pub fn build(self) -> Box<[usize]>

Builds the triangulations and returns all indices of the generated triangles

use triangular::Triangulation;

// build a set of points
let points = vec![(0.6, 1.1),
                  (0.2, 1.5),
                  (0.8, 1.6)];

let triangles = Triangulation::new(&points)
                    .build();