Crate delaunay2d [−] [src]
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 delaunay2d::{Delaunay2D, Triangle}; let mut dt = Delaunay2D::new((0., 0.), 9999.); dt.add_point((13., 12.)); dt.add_point((18., 19.)); dt.add_point((21., 5.)); dt.add_point((37., -3.)); let mut triangles = dt.export_triangles(); triangles.sort_by_key(|t| (t.0, t.1, t.2)); assert_eq!(vec![Triangle(2,1,0), Triangle(3, 1, 2)], triangles);
Example: Voronoi regions
use delaunay2d::{Delaunay2D}; let mut dt = Delaunay2D::new((0., 0.), 9999.); dt.add_point((13., 12.)); dt.add_point((18., 19.)); dt.add_point((21., 5.)); dt.add_point((37., -3.)); let (points, mut regions) = dt.export_voronoi_regions(); regions.sort(); assert_eq!(10, points.len()); assert_eq!(4, regions.len());
Structs
Delaunay2D | |
TNeighbours |
The triangles opposite to each vertex, if any. |
Triangle |
A triangle, represented as indices into a list of points |