rtriangulate

A Rust implementation of the Delaunay triangulation algorithm presented by Paul Bourke.

This was developed as an exercise to get more used to Rust. As far as I know, it works, but it might not. Also, this is a O(n1.5) (approximatively) algorithm, it's not parallelized, and it doesn't use the GPU at all.

Usage

Add the rtriangulate dependency to Cargo.toml:

[dependencies]

rtriangulate = "0.1"

And use the crate as such:

extern crate rtriangulate;

use rtriangulate::{Point, triangulate};

fn main() {
    // A list of points (which has to be sorted on x).
    let points = [Point::new(10.0, 50.0), Point::new(30.0, 40.0), Point::new(25.0, 40.0)];
    let triangles = triangulate(&points);

    println!("{:?}", triangles); // [Triangle(0, 1, 2)]
}

License

MIT - See LICENSE file.