% Delaunay2D
This crate provides a library for computing a Delaunay triangulation from a set of points using the Bowyer–Watson algorithm.
While performance shouldn't be terrible, there is definite room for improvement.
Usage
extern crate delaunay2d;
Example: Delaunay triangulation
use ;
let mut dt = new;
dt.add_point;
dt.add_point;
dt.add_point;
dt.add_point;
let mut triangles = dt.export_triangles;
triangles.sort_by_key;
assert_eq!;
Example: Voronoi regions
use ;
let mut dt = new;
dt.add_point;
dt.add_point;
dt.add_point;
dt.add_point;
let = dt.export_voronoi_regions;
regions.sort;
assert_eq!;
assert_eq!;