#geometry #delaunay

triangulation

A collection of triangulation algorithms

2 releases

0.1.1 Jan 27, 2019
0.1.0 Jan 25, 2019

#1869 in Algorithms

Download history 30/week @ 2023-08-08 36/week @ 2023-08-15 23/week @ 2023-08-22 19/week @ 2023-08-29 50/week @ 2023-09-05 35/week @ 2023-09-12 38/week @ 2023-09-19 37/week @ 2023-09-26 36/week @ 2023-10-03 30/week @ 2023-10-10 55/week @ 2023-10-17 45/week @ 2023-10-24 50/week @ 2023-10-31 47/week @ 2023-11-07 36/week @ 2023-11-14 38/week @ 2023-11-21

180 downloads per month
Used in 6 crates (via density-mesh-core)

MIT/Apache

140KB
607 lines

Rust port of delaunator.

Demo

WASM based browser demo. See wasm-demo/ folder.

Documentation

Example

use triangulation::{Delaunay, Point};

let points = vec![
    Point::new(10.0, 10.0),
    Point::new(100.0, 20.0),
    Point::new(60.0, 120.0),
    Point::new(80.0, 100.0)
];

let triangulation = Delaunay::new(&points).unwrap();
assert_eq!(&triangulation.triangles, &[3, 0, 2, 3, 1, 0]);

Performance

plot

Tests performed on Intel Core i5-2500 CPU @ 3.30GHz x 4

License

This project is licensed like the Rust language itself under either of

at your option.

Dependencies